A scatter search for multi-depot vehicle routing problem with weight-related cost

Asia-Pacific Journal of Operational Research

Volumn 28, Issue 3, 2011, Pages 323-348

  Zhang, Jun ^a   Tang, Jiafu ^a   Fung, Richard Y K ^b  

^a KEY LABORATORY OF INTEGRATED AUTOMATION OF PROCESS INDUSTRY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Multi depot vehicle routing problem; scatter search; weight related cost

Indexed keywords

COSTS; ITERATIVE METHODS; VEHICLES;

COMPUTATIONAL EXPERIMENT; MULTI-DEPOT VEHICLE ROUTING PROBLEMS; SCATTER SEARCH; SWEEP ALGORITHMS; TRIAL SOLUTIONS; VEHICLE ROUTING PROBLEM;

VEHICLE ROUTING;

EID: 84988231209     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595911003260     Document Type: Article

References (42)

1. Alegre, J, M Laguna and J Pacheco (2007). Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. European Journal of Operational Research, 179, 736-746. (Pubitemid 46038586)
2. Baldacci, R and A Mingozzi (2008). A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming, 1-34.
3. Banos, R, C Gil, J Reca and J Martinez (2007). Implementation of scatter search for multi-objective optimization: A comparative study. Computational Optimization and Applications, 1-21.
4. Chao, IM, BL 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.
5. Christofides, N and JE Beasley (1984). Period routing problem. Networks, 14, 237-256.
6. Christofides, N and S Eilon (1969). An algorithm for the vehicle dispatching problem. Operational Research Quarterly, 20, 309-318.
7. Chu, F, N Labadi and C Prins (2006). A scatter search for the periodic capacitated arc routing problem. European Journal of Operational Research, 169, 586-605. (Pubitemid 41375709)
8. Corberán, A, E Fernández, M Laguna and R Marti (2002). Heuristic solutions to the problem of routing school buses with multiple objectives. Journal of the Operational Research Society, 53, 427-435. (Pubitemid 34410652)
9. Cordeau, JF, M Gendreau and G Laporte (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105-119. (Pubitemid 127360996)
10. Crevier, B, JF Cordeau and G Laporte (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research, 176, 756-773. (Pubitemid 44537609)
11. Dondo, R and J Cerda (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176, 1478-1507. (Pubitemid 44573667)
12. Dror, M, G Laporte and P Trudeau (1994). Vehicle routing with split deliveries. Discrete Applied Mathematics, 50, 239-254.
13. Dueck, G (1993). New optimization heuristics: The great deluge algorithm and the recordto- record travel. Journal of Computational Physics, 104, 86-92.
14. Gendreau, M, A Hertz and G Laporte (1992). New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40, 1086-1094.
15. Gillett, BE and JG Johnson (1976). Multi-terminal vehicle-dispatch algorithm. Omega, 4, 711-718.
16. Glover, F (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8, 156-166.
17. Glover, F (1998). A template for scatter search and path relinking. In Proceedings of the Artificial Evolution: Third European Conference, LNCS 1363, 13-54. New York: Springer. (Pubitemid 128044715)
18. Glover, F, M Laguna and R Marti (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 29, 652-684.
19. Glover, F, M Laguna and R Marti (2003). Scatter Search. In A Ghosh and S Tsutsui (eds.), Advances in Evolutionary Computing: Theory and Applications. New York: Springer-Verlag, pp. 519-537.
20. Glover, F, M Laguna and R Marti (2004). Scatter search and path relinking: Foundations and advanced designs. In GC Onwubolu and BV Babu (eds.), New Optimization Techniques in Engineering. Heidelberg: Springer-Verlag, pp. 87-99.
21. Goetschalckx, M and C Jacobs-Blecha (1989). The vehicle routing problem with backhauls. European Journal of Operational Research, 42, 39-51.
22. Irnich, S, B Funke and T Grunert (2006). Sequential search and its application to vehiclerouting problems. Computers and Operations Research, 33, 2405-2429. (Pubitemid 41802296)
23. Laguna, M and R Marti (2003). Scatter Search: Methodology and Implementations in C. London: Kluwer Academic Publishers.
24. Laporte, G and Y Nobert (1983). A branch and bound algorithm for the capacitated vehicle routing problem. OR Spektrum, 5, 77-85.
25. Laporte, G, Y Nobert and D Arpin (1984). Optimal solutions to capacitated multidepot vehicle routing problems. Congressus Numerantium, 44, 283-292.
26. 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. (Pubitemid 18654114)
27. Lim, A and W Zhu (2006). A fast and effective insertion algorithm for multi-depot vehicle routing problem with fixed distribution of vehicles and a new simulated annealing approach. In Proceedings of the 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2006), LNCS 4031, 282-291. New York: Springer. (Pubitemid 44089676)
28. Marti, R (2006). Scatter search - Wellsprings and challenges. European Journal of Operational Research, 169, 351-358. (Pubitemid 41375695)
29. Marti, R, M Laguna and F Glover (2006). Principles of scatter search. European Journal of Operational Research, 169, 359-372. (Pubitemid 41375696)
30. Min, H (1989). The multiple vehicle routing problem with simultaneous delivery and pickup points. Transportation Research Part A: General, 23, 377-386.
31. Mingozzi, A (2005). The multi-depot periodic vehicle routing problem. In Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation (SARA 2005), LNCS 3607, 347-350. New York: Springer.
32. Mota, E, V Campos and Á Corberán (2007). A new metaheuristic for the vehicle routing problem with split demands. In Proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2007), LNCS 4446, 121-129. New York: Springer.
33. Pisinger, D and S Ropke (2007). A general heuristic for vehicle routing problems. Computers and Operations Research, 34, 2403-2435. (Pubitemid 46073431)
34. Polacek, M, RF Hartl, K Doerner and M Reimann (2004). A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics, 10, 613-627. (Pubitemid 40356746)
35. Prins, C (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research, 31, 1985-2002. (Pubitemid 38728564)
36. Renaud, J, G Laporte and FF Boctor (1996). A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research, 23, 229-235.
37. Rochat, Y and É Taillard (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1, 147-167.
38. Russell, RA and WC Chiang (2006). Scatter search for the vehicle routing problem with time windows. European Journal of Operational Research, 169, 606-622. (Pubitemid 41375710)
39. 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. (Pubitemid 127396732)
40. Solomon, MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254-265.
41. Tillman, FA and TM Cain (1972). An upperbound algorithm for the single and multiple terminal delivery problem. Management Science, 18, 664-682.
42. Tillman, FA and RW Hering (1971). A study of a look-ahead procedure for solving the multiterminal delivery problem. Transportation Research, 5, 225-229.