Applying simulated annealing approach for capacitated vehicle routing problems

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn 1, Issue , 2006, Pages 639-644

  Lin, S W ^a   Ying, K C ^a   Lee, Z J ^a   Hsi, F H ^a  

^a HUAFAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; NETWORK ROUTING; PROBLEM SOLVING; SIMULATED ANNEALING; VEHICLE LOCATING SYSTEMS;

BENCHMARK PROBLEMS; MINIMUM-COST VEHICLE ROUTES; RELATIVE DEVIATION PERCENTAGE (RDP);

STREET TRAFFIC CONTROL;

EID: 34548134495     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2006.384457     Document Type: Conference Paper

References (26)

1. J.Xu and J.P.Kelly, "A network flow-based tabu search heuristic for the vehicle routing problem," Transportation Science, vol. 30, 1996, pp.379-393.
2. N. Christofides, A. Mingozzi, and P. Toth, "Exact algorithm for the vehicle routing problem, based on spanning tree and shortest path relaxations," Mathematical Programming, vol. 20, 1981, pp. 255-282.
3. M. L. Fisher and R. Jaikumar, "A generalized assignment heuristic for vehicle routing," Networks, vol. 11, 1981, pp. 109-124.
4. G. Clarke and J. W. Wright, "Scheduling of vehicles from a central depot to a number of delivery points," Operations Research, vol. 12, 1964, pp. 568-581.
5. T. J. Gaskell, "Bases for vehicle fleet scheduling," Operational Research Quarterly, vol. 18, 1967, pp. 281-295.
6. P. Yellow, "A computational modification to the savings method of vehicle scheduling," Operational Research Quarterly, vol. 21, 1970, pp. 281-283.
7. G. Lapone and F. Semet, The vehicle routing problem, In P. Toth and D. Vigo editore, SIAM Monographs on Discrete Mathematics and Application, Philadelphia, 2001, pp. 109-125.
8. B. Gillett and L. Miller, "A heuristic algorithm for the vehicle dispatch problem," Operations Research, vol. 22, 1974, pp. 340-349.
9. B.Gillet and L. Miller, "A heuristic algorithm for vehicle dispatches," Operations Research, vol. 13, 1976, pp. 340-349.
10. N. Christofides, A. Mingozzi, and P. Toth, The vehicle routing Problem, In N. Christofides, A. Mingozzi, P. Toth, and C. Sandi, editors, Combinatorial Optimization, 1979, pp. 325-338, Wiley, Chichester.
11. M.Fisher and R. Jaikumar," A generalized assignment heuristic for vehicle routing, "Networks 11, 1981, pp. 109-124.
12. J. Beasley, "Route first-cluster second methods for vehicle routing," Omega, vol. 11, 1983, pp. 403-408.
13. M. Haimovich and A.H.G. Rinnooy Kan, "Bounds and heuristics for capacitated routing problems," Mathematics of Operations Research, vol. 10, 1985, pp. 527-542.
14. R.H. Mole and S. R. Jameson, "A sequential route-building algorithm employing a generalised savings criterion," Operation Research Quarterly, vol. 27, 1976, pp. 503-511.
15. S. Lin, "Computer solutions of the traveling salesman problem," Bell System Technical Journal, vol. 44, 1965, pp. 2245-2269.
16. F. Robusté, C. F. Daganzo, and R. Souleyrette II, "Implementing vehicle routing models," Transportation Research, vol. 24B, 1990, pp. 263-286.
17. A. S. Alfa, S. S. Heragu, and M. Chen, "A 3-opt based simulated annealing algorithm for vehicle routing problem," Computers & Industrial Engineering, vol. 21, 1991, pp. 635-639.
18. I. H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem," Annals of Operations Research, vol. 41, 1993, pp. 421-451.
19. M. P. Gendreau, A. Hertz and G. Laporte, "A tabu search heuristic for the vehicle routing problem," Management Science, vol. 40, 1994, pp. 1276-1290.
20. P. Toth and D. Vigo, "The granular tabu search and its application to the vehicle-Routing Problem," INFORMS Journal on Computing Linthicum, vol. 15, 2003, pp. 333-346.
21. E. D. Taillard, "Parallel iterative search methods for vehicle routing problem," Networks, vol. 23, 1993, pp. 661-673.
22. Y. Rochat and E. D. Taillard, "Probabilistic diversification and intensification in local search for vehicle routing," Journal of Heuristics, vol. 1, 1995, pp. 147-167.
23. B.M. Baker, and M.A. Ayechew, "A genetic algorithm for the vehicle routing problem," Computers & Operations Research, vol. 30, 2003, pp. 787-800.
24. B. Bullnheimer, R. F. Hartl, and Strauss, "An improved ant system algorithm for the vehicle routing problem," Annals of Operations Research, vol. 89, 1999, pp. 319-328.
25. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and. E. Teller, "Equations of state calculations by fast computing machines," Journal of Chemical Physics, vol. 21, 1953, pp. 1087-1092.
26. S. Kirkpatrik, C. D. Gelatt, and J. M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, 1983, pp. 671-680.