Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem

Robotics and Computer-Integrated Manufacturing

Volumn 26, Issue 6, 2010, Pages 564-569

  Mirabi, M ^a   Fatemi Ghomi, S M T ^b   Jolai, F ^c  

^a YAZD UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^c UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Hybrid heuristic; Multi depot vehicle routing problem; Simulated annealing

Indexed keywords

CONSTRUCTIVE HEURISTIC; DELIVERY TIME; HYBRID HEURISTICS; IMPROVEMENT TECHNIQUE; TEST PROBLEM; VEHICLE ROUTING PROBLEMS;

ANNEALING; ROUTING ALGORITHMS; STATISTICAL TESTS; STOCHASTIC SYSTEMS; VEHICLES;

SIMULATED ANNEALING;

EID: 78049254817     PISSN: 07365845     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.rcim.2010.06.023     Document Type: Conference Paper

References (21)

1. K.C. Tan, C.Y. Cheong, and C.K. Goh Solving multiobjective vehicle routing problem with stochastic demand, Via Evol Comput 177 2007 813 839
2. W. Ho, T.S. Ho, P. Ji, and C.W. Lau A hybrid genetic algorithm for the multi-depot vehicle routing problem Eng Appl Artif Intell 21 2008 548 557
3. J. Renaud, G. Laporte, and F.F. Boctor A tabu search heuristic for the multi-depot vehicle routing problem Comput Oper Res 23 1996 229 235
4. J.F. Cordeau, M. Gendreau, and G. Laporte A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 1997 105 119 (Pubitemid 127360996)
5. I. Chao, B.L. Golden, and E. Wasil A new heuristic for the multi-depot vehicle routing problem that improves upon best known solutions Am J Math Manage Sci 13 1993 371 406
6. B. Farhang Moghadam, and S.M. Seyedhosseini A particle swarm approach to solve vehicle routing problem with uncertain demand: A drug distribution case study Int J Ind Eng Comput 1 2010 55 64
7. D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Comput Oper Res 34 2007 2403 2435
8. B. Crevier, J. Cordeau, and G. Laporte The multi-depot vehicle routing problem with inter-depot routes Eur J Oper Res 176 2007 756 773 (Pubitemid 44537609)
9. S. Salhi, and M. Sari A multi-level composite heuristic for the multidepot vehicle fleet mix problem Eur J Oper Res 103 1997 95 112
10. C.T. Su Dynamic vehicle control and scheduling of a multi-depot physical distribution system Integr Manuf Syst 10 1999 56 65
11. T.H. Wu, C. Low, and J.W. Bai Heuristic solutions to multi-depot location-routing problem Comput Oper Res 29 2002 1393 1415
12. I.D. Giosa, I.L. Tansini, and I.O. Viera New assignment algorithms for the multi-depot vehicle routing problem J Oper Res Soc 53 2002 977 984
13. M. Wasner, and G. Zapfel An integrated multi-depot hub-location vehicle routing model for network planning of parcel service Int J Prod Econ 90 2004 403 419
14. G. Nagy, and S. Salhi Heuristic algorithms for the single and multiple depot vehicle routing problems with pickups and deliveries Eur J Oper Res 162 2005 126 141
15. A. Haghani, and S. Jung A dynamic vehicle routing problem with time-dependent travel times Comput Oper Res 32 2005 2959 2986
16. E.H.L. Aarts, and J.H.M. Korst Simulated annealing and Boltzman machines 1989 Wiley Chichester
17. P.J.M. Van Laarhoven, and E.M.L. Aarts Simulated annealing: theory and applications 1987 Reidel Dordrecht, The Netherlands
18. G. Clarke, and J. Wright Scheduling of vehicles from a central depot to a number of delivery points Oper Res 12 1964 568 581
19. G. Reinelt The traveling salesman: computational solutions for TSP applications 1994 Springer New York
20. B Hajek, A tutorial survey of theory and applications of simulated annealing. In: proceedings of IEEE conference on decision and control, 1985, p. 75560.
21. SR Gupta, JS Smith, Algorithms for single machine total tardiness scheduling with sequence dependent setups, Eur J Oper Res