A complementary tool to enhance the effectiveness of existing methods for heterogeneous fixed fleet vehicle routing problem

Applied Mathematical Modelling

Volumn 37, Issue 6, 2013, Pages 4316-4324

  Naji Azimi, Zahra ^a   Salari, Majid ^a  

^a FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

Author keywords

Heuristics; Integer linear programming; Vehicle routing problem

Indexed keywords

COMPLEMENTARY TOOLS; COMPUTATIONAL RESULTS; FIXED NUMBERS; HEURISTIC APPROACH; HEURISTICS; INTEGER LINEAR PROGRAMMING; VARIABLE COSTS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

COST ACCOUNTING; FLEET OPERATIONS; HEURISTIC METHODS; INTEGER PROGRAMMING; NETWORK ROUTING;

ROUTING ALGORITHMS;

EID: 84872618795     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2012.09.027     Document Type: Article

References (32)

1. The vehicle routing problem, Monographs on Discrete Mathematics and Applications 2002, SIAM, Philadelphia, PA. P. Toth, D. Vigo (Eds.).
2. Renaud J., Laporte G., Boctor F.F. A tabu search heuristic for the multi-depot vehicle routing problem. Comput. Operat. Res. 1996, 23(3):229-235.
3. Salari M., Toth P., Tramontani A. An ILP improvement procedure for the open vehicle routing problem. Comput. Operat. Res. 2010, 37:2106-2120.
4. Goetschalckx M., Jacobs-Blecha C. The vehicle routing problem with backhauls. Eur. J. Operat. Res. 1989, 42(1):39-51.
5. Pop P.C., Kara I., Horvat Marc A. New mathematical models of the generalized vehicle routing problem and extensions. Appl. Math. Modell. 2012, 36:97-107.
6. Pop P.C., Matei O., Valean H. An efficient soft computing approach to the generalized vehicle routing problem. Adv. Intell. Soft Comput. 2011, 87:281-289.
7. Taillard E.D. A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 1999, 33:1-14.
8. Rochat Y., Taillard E.D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1995, 1:147-167.
9. Taillard E.D. Parallel iterative search methods for vehicle routing problems. Networks 1993, 23:661-672.
10. Tarantilis C., Kiranoudis C., Vassiliadis V. A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. J. Operat. Res. Soc. 2003, 54:65-71.
11. Tarantilis C., Kiranoudis C., Vassiliadis V. A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Eur. J. Operat. Res. 2004, 152:148-158.
12. Dueck G., Scheuer T. Threshold accepting. A general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 1990, 90:161-175.
13. Dueck G. New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 1993, 104:86-92.
14. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science 1983, 220:671-680.
15. Li F., Golden B., Wasil E. A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comput. Operat. Res. 2007, 34:2734-2742.
16. Li X., Tian P., Aneja Y.P. An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transport. Res. Part E 2010, 46:1111-1127.
17. Glover F., Laguna M. Tabu Search 1997, Kluwer, Boston.
18. Brandão J. A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput. Operat. Res. 2011, 38:140-151.
19. Choi E., Tcha D.W. A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Operat. Res. 2007, 34:2080-2095.
20. Gendreau M., Laporte G., Musaraganyi C., Taillard E. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Operat. Res. 1999, 26:1153-1173.
21. Lima C.M.R.R., Goldbarg M.C., Goldbarg E.F.G. A memetic algorithm for the heterogeneous fleet vehicle routing problem. Electron. Notes Discrete Math. 2004, 18:171-176.
22. Baldacci R., Battarra M., Vigo D. Routing a heterogeneous fleet of vehicles. The Vehicle Routing Problem: Latest Advances and New Challenges 2008, 3-27. Springer, New York. B. Golden, S. Raghavan, E. Wasil (Eds.).
23. Golden B.L., Assad A.A., Levy L., Gheysens F.G. The fleet size and mix vehicle routing problem. Comput. Operat. Res. 1984, 11:49-66.
24. Yaman H.D. Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math. Program. 2006, 106:365-390.
25. De Franceschi R., Fischetti M., Toth P. A new ILP-based refinement heuristic for vehicle routing problems. Math. Program. 2006, 105:471-499.
26. Toth P., Tramontani A. An integer linear programming local search for capacitated vehicle routing problems. The Vehicle Routing Problem: Latest Advances and New Challenges 2008, 275-295. Springer, New York. B. Golden, S. Raghavan, E. Wasil (Eds.).
27. Salari M., Naji-Azimi Z. An integer programming-based local search for the covering salesman problem. Comput. Operat. Res. 2012, 39:2594-2602.
28. Naji-Azimi Z., Salari M., Toth P. An ILP-based heuristic approach for the capacitated m-ring star problem. Eur. J. Operat. Res. 2011, 217:17-25.
29. Feillet D., Dejax P., Gendreau M., Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 2004, 44:216-229.
30. Righini G., Salani M. New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 2008, 51:155-170.
31. IBM, ILOG Cplex, http://www.ilog.com.
32. Christofides N., Eilon S. An algorithm for the vehicle-dispatching problem. Operat. Res. Quart. 1969, 20:309-318.