Efficient neighborhood search for the probabalistic pickup and delivery travelling salesman problem

Efficient neighborhood search for the probabalistic pickup and delivery travelling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20052835
Country: United States
Volume: 45
Issue: 4
Start Page Number: 195
End Page Number: 198
Publication Date: Apr 2005
Journal: Networks
Authors: , , ,
Abstract:

In this article the probabilistic pickup and delivery travelling salesman problem is studied and an efficient neighborhood search procedure is developed. This procedure requires O(n3) computations for the evaluation of the neighborhood of a given solution while the straightforward approach has an O(n5) complexity.

Reviews

Required fields are marked *. Your email address will not be published.