Journal
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
Volume 6, Issue 2, Pages 435-451Publisher
AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/jimo.2010.6.435
Keywords
simulated annealing; tabu search; pickup and delivery vehicle routing problem; time windows
Ask authors/readers for more resources
A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows and multiple vehicles is considered in this paper. The first stage uses simulated annealing algorithm to decrease the number of used vehicles, the second stage uses tabu search to decrease the total travel cost. Experimental results show the effectiveness of the algorithm which has produced many new best solutions on problems within 600 customers. In particular, it has improved 45% and 81.7% of the best solutions on the 200 and 600-customer benchmarks, sometimes by as much as 3 vehicles. These results further confirm the benefits of two-stage approaches in vehicle routing problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available