A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem

Computers and Operations Research

Volumn 36, Issue 2, 2009, Pages 442-460

  Ambrosino, Daniela ^a   Sciomachen, Anna ^a   Scutellà, Maria Grazia ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CUSTOMER SATISFACTION; DISTRIBUTED PARAMETER NETWORKS; DISTRIBUTION OF GOODS; ELECTRIC POWER DISTRIBUTION; HEURISTIC METHODS; HEURISTIC PROGRAMMING; RELOCATION; SALES; SOLUTIONS; VEHICLES;

CASE STUDIES; COMPUTATIONAL EXPERIMENTATION; CUSTOMER DEMANDS; DISTRIBUTION NETWORKS; FEASIBLE SOLUTIONS; FLEET ASSIGNMENT; LARGE NEIGHBORHOOD SEARCH; LOCAL SEARCH; LOCATION-ROUTING PROBLEM; MEDIUM SIZE; ROUTING DECISIONS; SET OF CUSTOMERS; TIME LIMIT;

FLEET OPERATIONS;

EID: 52049103673     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.09.012     Document Type: Article

References (31)

1. Min H., Jayaraman V., and Srivastava R. Combined location-routing problems: a synthesis and future research directions. European Journal of Operational Research 108 (1998) 1-15
2. Laporte G. Location-routing problems. In: Golden BL, Assad AA, editors. Vehicle routing: methods and studies. Amsterdam: North-Holland; 1988. p. 163-97.
3. Singh RD. Location-routing Problems. PhD dissertation, UMI, Dissertation Information Service; 1998.
4. Ambrosino D., and Scutellà M.G. Distribution network design: new problems and related models. European Journal of Operational Research 165 (2005) 610-624
5. Caballero R, Gonzàlez M, Guerrero FM, Molina J, Paralera C. Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia. European Journal of Operational Research 2005, to appear.
6. Li F., Golden B., and Wasil E. A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers & Operations Research 34 (2007) 2734-2742
7. Tarantilis C.D., Kiranoudis C.T., and Vassiliadis V.S. A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research 152 (2004) 148-158
8. Golden B., Assad A., Levy L., and Gheysens F. The fleet size and mix vehicle routing problem. Computers and Operations Research 11 (1984) 49-66
9. Gendreau M., Laporte G., Musaraganyi C., and Taillard E. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research 26 (1999) 1153-1173
10. Choi E., and Tcha D.-W. A column generation approach to the heterogeneous fleet vehicle routing problem. Computers & Operations Research 34 (2007) 2080-2095
11. Salhi S., and Sari M. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research 103 (1997) 95-112
12. Dondo R., and Cerdá J. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research 176 (2007) 1478-1507
13. Crevier B, Cordeau J-F, Laporte G. The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research 2005, to appear.
14. Perl J., and Daskin M.S. A warehouse location-routing problem. Transportation Research B 19 (1985) 381-396
15. Hansen P.H., Hegedahl B., Hjortkjaer S., and Obel B. A heuristic solution to the warehouse location-routing problem. European Journal of Operational Research 76 (1994) 111-127
16. Wu T., Low C., and Bai J. Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research 29 (2002) 1393-1415
17. Tuzun D., and Burke L.I. A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116 (1999) 87-99
18. Albareda-Sambola M., Diaz J.A., and Fernandez E. A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research 32 (2005) 407-428
19. Ambrosino D. Progetto di reti distributive: alcuni modelli ed un approccio di ricerca locale basato su tecniche "multiscambio". PhD dissertation, Università di Pisa, Italy; 2001.
20. Barreto S., Ferreira C., Paixao J., and Santos B.S. Using clustering analysis in a capacitated location-routing problem. European Journal of Operational Research 179 (2007) 968-977
21. Christofides N. Vehicle routing. In: Lawer EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB, editors. The traveling salesman problem. Chichester: Wiley; 1985. p. 431-48.
22. Ahuja R.K., Orlin J.B., Pallottino S., Scaparra M.P., and Scutellà M.G. A multi-exchange heuristic for the single source facility location problem. Management Science 50 6 (2004) 749-760
23. Pallottino S., Scaparra M.P., and Scutellà M.G. Large scale local search heuristics for the capacitated vertex p-center problem. Networks 43 4 (2004) 241-255
24. Thompson PM, Orlin JB. Theory of cyclic transfers. Working paper no. OR 200-89, Operations Research Center, MIT, Cambridge, MA; 1989.
25. Thompson P.M., and Psaraftis H.N. Cyclic transfer algorithms for multivehicle routing and scheduling problems. Operations Research 41 (1993) 935-946
26. ILOG CPLEX 9.1, user manual.
27. Bramel J.B., and Simchi-Levi D. A location based heuristic for the delivery problem. Operations Research 43 (1995) 649-660
28. Carpaneto G., Dell'Amico M., and Toth P. Exact solution of large scale asymmetric travelling salesman problems. Transactions on Mathematical Software 21 (1995) 394-409
29. Perl J. A unified warehouse location-routing analysis. PhD dissertation, UMI Dissertation Information Service; 1983.
30. Maximal Software, Inc., MPL Modelling System, USA.
31. Ambrosino D., and Sciomachen A. A food distribution network problem: a case study. IMA Journal of Management Mathematics 18 1 (2007) 33-53