Metaheuristic approach for the multi-depot vehicle routing problem

Applied Artificial Intelligence

Volumn 26, Issue 9, 2012, Pages 878-901

  Geetha, S ^a   Vanathi, P T ^a   Poonthalir, G ^a  

^a PSG COLLEGE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DISTRIBUTION OF GOODS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; OPERATIONS RESEARCH; PARTICLE SWARM OPTIMIZATION (PSO); POLYNOMIAL APPROXIMATION; VEHICLE ROUTING; WAREHOUSES;

DISTRIBUTION LOGISTICS; GENETIC ALGORITHM AND PARTICLE SWARM OPTIMIZATIONS; HYBRID PARTICLE SWARM OPTIMIZATION; META-HEURISTIC APPROACH; METAHEURISTIC; MULTI DEPOTS; MULTI-DEPOT VEHICLE ROUTING PROBLEMS; NONDETERMINISTIC POLYNOMIAL; POLYNOMIAL-TIME; VEHICLE ROUTING PROBLEMS;

MATLAB;

EID: 84867765123     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839514.2012.727344     Document Type: Article

References (38)

1. Ai, T. J. and, V. Kachitvichyanukul. 2007. Particle swarm optimization for the capacitated vehicle routing problem. International Journal of Logistics and SCM Systems 2: 55.
2. Ai, T. J. and, V. Kachitvichyanukul. 2009a. A partice swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research 36: 1693-1702.
3. Ai, T. J. and, V. Kachitvichyanukul. 2009b. Particle swarm optimization and two solution representation for solving the capacitated vehicle routing problem. Computer and Industrial Engineering 56: 380-387.
4. Anderberg, M. R. 1973. Cluster analysis for applications. New York, NY: Academic Press.
5. Ball, M. O., B. L. Golden., A. A. Assad., and, L. D. Bodin. 1983. Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences 14: 103-120.
6. Baker, B. M., and, M. A. Ayechew. 2003. A genetic algorithm for vehicle routing problem. Computational and Operational Research 30: 787-800.
7. Beasley, J. C. 1983. Route first-cluster second method for vehicle routing. International Journal of Managment Science 2: 403-408.
8. Berger, J., and, M. Barkaoui. 2003. A hybrid genetic algorithm for the capacitated vehicle routing problem. In Proceedings of the 2003 International conference on Genetic and Evolutionary Computation, 646-656. Berlin: Springer-Verlag.
9. Chao, I.-M., B. L. Golden., and, E. Wasil. 1993. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. American Journal of Mathematical and Management Sciences 13: 371-406.
10. Chen, A.-L., G.-K. Yang., and, Z.-M. Wu. 2006. Hybrid discrete paticle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University 7 (4): 607-614.
11. Clarke, G., and, J. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (4): 568-581.
12. Dantzig, G. B., and, J. H. Ramset. 1958. The truck dispatching problem. Management Science 6: 81-91.
13. Fisher, M. L., and, R. Jaikumar. 1981. A generalized assignment heuristic for vehicle routing. Networks 11: 109-124.
14. Fisher, M. L. 1994. Optimal solution of vehicle routing problems using minimum k-trees. Operations Research 42: 626-642.
15. Gillet, B., and, J. Johnson. 1976. The multiple terminal vehicle dispatching algorithm. Omega 4: 711-718.
16. Giosa, I. D., I. L. Tansini., and, I. O. Viera. 2002. New assignment algorithms for the multi-depot vehicle routing problem. Journal of the Operational Research Society 53: 977-984.
17. Golden, B. L., T. L. Magnanti., and, H. Q. Nguyen. 1977. Implementing vehicle routing algorithm. Networks 7: 113-148.
18. Markovi, H., I. avar., and, T. Cari. 2005. Using datamining to forecast uncertain demands in stochastic vehicle routing problem. Proceedings of the 13 th International symposium on electronics in traffic. Ljubljana, Slovenia.
19. Klots, B., S. Gal., and, A. Harpaz. 1992. Multi-depot and multi-product delivery optimization problem with time and service constraints. Technical Report. IBM Israel, Haifa, Israel.
20. Ladányi, L., T. K. Ralphs., and, L. E. Trotter, Jr. 2001. Branch, cut, and price: Sequential and parallel, in computational combinatorial optimization, eds. D. Naddef. and M. Juenger., Berlin: Springer.
21. Lang, M.-X. 2006. Study on the model and algorithm for multi-depot vehicle schedling problem. Journal of Transportation Systems Engineering and Information Technology 16 (15): 65-70.
22. Laporte, G., Y. Nobert., and, D. Arpin. 1984. Optimal solutions to capacitated multidepot vehicle routing problems. Congressus Numerantium 44: 283-292.
23. Laporte, G., Y. Nobert., and, S. Taillefer. 1988. Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science 22: 161-172.
24. Luo, X. G., and, H. B. Shi. 2006. Improved particle swarm optimization for vehicle routing problem with non-full load. Journal of East China University of Science and Technology (Natural Science Edition) 32 (7): 767-771.
25. Ning, L., Z. Tong., and, S. Debao. 2004. Particle swarm optimization for vehicle routing problem. Journal of Systems Engineering 19: 596-600.
26. Potvin, J., and, J. Rousseau. 1993. A parallel route building algorithm for the vrptw. European Journal of Operational Research 66: 331-340.
27. Raft, O. M. 1982. A modular algorithm for an extended vehicle scheduling problem. European Journal of Operational Research 11: 67-76.
28. Reimann, M., K. Doerner., and, R. F. Hartl. 2004. D-ants: Savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31: 563-591.
29. Renaud, J., G. Laporte., and, F. F. Boctor. 1996. A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research 23: 229-235.
30. Salhi, S., and, M. Sari. 1997. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research 103: 95-112.
31. Shao, Z. J., S. P. Gao., and, S. S. Wang. 2009. A hybrid particle swarm optimization algorithm for vehicle routing problem with stochastic travel time. Fuzzy Information and Engineering 54: 566-574.
32. Su, C. T. 1999. Dynamic Vehicle control and scheduling of a multi-depot physical distribution system. Integrated Manufacturing Systems 10: 56-65.
33. Taillard,. D. 1993. Parallel iterative search methods for vehicle routing problems. Networks 23: 661-673.
34. Tillman, F. A. 1969. The multiple terminal delivery problem with probabilistic demands. Transportation Science 3: 192-204.
35. Wu, Y., C. M. Ye., and, H. M. Ma. 2007. Parallel particle swarm optimization algorithm for vehicle routing problem with time windows. Computer Engineering and Applications 43 (14): 223-226.
36. Wren, A., and, A. Holliday. 1972. Computer scheduling of vehicles from one or more depots to a number of delivery points. Operational Research Quarterly 23: 333-344.
37. Yellow, P. 1970. A Computational modification to the savings method of vehicle scheduling. Operational Research Quarterly 21: 281-283.
38. Zhang, N. Z., and, Y. H. Wu. 2008. Particle swarm optimization with near neighbourhood factor based on vehicle routing problem. Computer Engineering and Applications 44 (32): 216-218.