Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic

References

• Ahlander F. The capacitated facility location problem with single sourcing. (1994) . Unpublished doctoral dissertation, Linkoping University, SwedenGoogle Scholar
• Albareda-Sambola M., Díaz J. A., Fernández E. A compact model and tight bounds for a combined location-routing problem. Comput. Oper. Res. (2005) 32(3):407–428Crossref, Google Scholar
• Barreto S. S. Home page of Sérgio Sautos Barreto. (2004a) . http://sweet.ua.pt/∼iscf143Google Scholar
• Barreto S. S. Análise e Modelização de Problemas de localização-distribuição [Analysis and modelling of location-routing problems]. (2004b) . Unpublished doctoral dissertation, University of Aveiro, Campus Universitário de Santiago, 3810-193 Aveiro, PortugalGoogle Scholar
• Beasley J. E. Lagrangean heuristics for location problems. Eur. J. Oper. Res. (1993) 65:383–399Crossref, Google Scholar
• Bruns A., Klose A., Zimmermann U., Derigs U., Gaul W., Mohring R. H., Schuster K. P. A “locate first-route second” heuristic for a combined location-routeing problem. Operations Research Proceedings (1996) (Springer, Braunschweig, Germany) Google Scholar
• Chan Y., Carter W. B., Burnes M. D. A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput. Oper. Res. (2001) 28:803–826Crossref, Google Scholar
• Chien T. W. Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems. Decision Sci. (1993) 24(5):995–1021Crossref, Google Scholar
• Cortinhal M. J., Captivo M. E. Upper and lower bounds for the single source capacitated location problem. Eur. J. Oper. Res. (2003) 151:333–351Crossref, Google Scholar
• Dongarra Jack J. Performance of various computers using standard linear equations software. (2006) . Technical Report CS-89-85, University of TennesseeGoogle Scholar
• Ghiani G., Laporte G. Location-arc routing problems. OPSEARCH (2001) 38:151–159Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Labadi N. Problèmes tactiques et stratégiques en tournées sur arcs [Tactical and strategic problems on arc routing]. (2003) . Unpublished doctoral thesis, University of Technology of Troyes, FranceGoogle Scholar
• Laporte G., Louveaux F., Mercure H. Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. (1989) 39:71–78Crossref, Google Scholar
• Laporte G., Norbert Y., Taillefer S. Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Sci. (1988) 22(3):161–167Link, Google Scholar
• Lin S., Kernighan B. W. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. (1973) 21:498–516Link, Google Scholar
• Min H., Jayaraman V., Srivastava R. Combined location-routing problems: A synthesis and future research directions. Eur. J. Oper. Res. (1998) 108:1–15Crossref, Google Scholar
• Pirkul H. Efficient algorithm for the capacitated concentrator location problem. Comput. Oper. Res. (1987) 14:197–208Crossref, Google Scholar
• Pisinger D. A minimal algorithm for the 0-1 knapsack problem. Oper. Res. (1997) 45:758–767Link, Google Scholar
• Prins C., Prodhon C., Wolfler Calvo R., Dolgui A., Dauzère-Pérès S. Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité. MOSIM '04 (2004) 2(Lavoisier, Ecole des Mines de Nantes, France) 1115–1122Google Scholar
• Prins C., Prodhon C., Wolfler Calvo R. A reactive GRASP and path relinking algorithm for the capacitated location routing problem. CD Proc. Internat. Conf. Indust. Engrg. Systems Management (2005) MayMarrakech, MoroccoGoogle Scholar
• Prins C., Prodhon C., Wolfler Calvo R. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR—Quart. J. Oper. Res. (2006) 4(3):221–238Crossref, Google Scholar
• Salhi S., Rand G. K. The effect of ignoring routes when locating depots. Eur. J. Oper. Res. (1989) 39:150–156Crossref, Google Scholar
• Srivastava R. Alternate solution procedures for the locating-routing problem. OMEGA Internat. J. Management Sci. (1993) 21(4):497–506Crossref, Google Scholar
• Toth P., Vigo D. The granular tabu search and its application to the vehicle routing problems. INFORMS J. Comput. (2003) 15(4):333–346Link, Google Scholar
• Tuzun D., Burke L. I. A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. (1999) 116:87–99Crossref, Google Scholar
• Wu T. H., Low C., Bai J. W. Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. (2002) 29:1393–1415Crossref, Google Scholar