Solving the Multi-depot Locationrouting Problem with Lagrangian relaxation

Operations Research/ Computer Science Interfaces Series

Volumn 37, Issue , 2007, Pages 125-144

  Özyurt, Zeynep ^a   Aksen, Deniz ^a  

^a KOÇ UNIVERSITY   (Turkey)

Author keywords

Heuristics; Lagrangian relaxation; Location routing; Tabu search

Indexed keywords

EID: 84888618179     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-48793-9_9     Document Type: Article

References (18)

1. Ahipasaoglu, S. D., Erdogan, G. and Tansel, B., "Location-routing problems: a review and assessment of research directions, " Working Paper lEOR 2003-07, Department of Industrial Engineering, Bilkent University, Ankara, Turkiye (2004).
2. Aksen, D. and Altinkemer, K., "Efficient frontier analysis and heuristics for etailing logistics. " Working Paper, Purdue University, Krannert Graduate School of Management: West Lafayette, Indiana, USA (2003).
3. Aksen, D. and Altinkemer, K., "A location-routing problem for the conversion to the 'clickand-mortar' retailing: the static case, " Working Paper, College of Administrative Science and Economics, K09 University, Istanbul, Turkiye (2005).
4. Aksen, D., Ozyurt, Z. and Aras, N., "Open vehicle routing problem with driver nodes and time windows, " available online in Journal of Operational Research Society, August 2006, (doi: 10. 1057/palgrave. jors. 2602249).
5. 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, 407-428 (2005).
6. Ambrosino, D. and Scutella, M. G., "Distribution network design: new problems and related models, " European Journal of Operational Research 165, 610-624 (2005).
7. Crainic, T. G. and Laporte, G., "Planning models for freight transportation, " European Journal of Operational Research 97, 409-438 (1997).
8. Garey, G. and Johnson, D. S., "Computers and intractability: a guide to the theory of NPcompleteness, " W. H. Freeman and Company: New York (1979).
9. Gavish, B., "Augmented Lagrangian based algorithms for centralized network design, " IEEE Transactions on Communications COM-33, 1247-1257 (1985).
10. Geoffrion, A. M., "Lagrangian relaxation and its uses in integer programming. " Mathematical Programming Study 2, 82-114 (1974).
11. Jacobsen, S. K. and Madsen, O. B. G., "A comparative study of heuristics for a two-level routing-location problem, " European Journal of Operational Research 5, 378-387 (1980).
12. Laporte, G., Nobert, Y. and Taillefer, S., "Solving a family of multi-depot vehicle routing and location-routing problems, " Transportation Science 22, 161-172 (1988).
13. Melechovsky, J., Prins, C. and Calvo, R. W., "A metaheuristic to solve a location-routing problem with non-linear costs, " Journal of Heuristics 11, 375-391 (2005).
14. Min, H., Jayaraman, V. and Srivastava, R., "Combined location-routing: a synthesis and future research directions, " European Journal of Operational Research 108, 1-15 (1998).
15. Salhi, S. and Rand, G. K., "The effect of ignoring routes when locating depots, " European Journal of Operational Research 39, 150-156 (1989).
16. Srivastava, R., "Alternate solution procedures for the location routing problem. " Omega International Journal of Management Science 21, 497-506 (1993).
17. Tuziin, D., and Burke, L. I, "A two-phase tabu search approach to the location routing problem, " European Journal of Operational Research 116, 87-99 (1999).
18. Wu, T. H., Low, C. and Bai, J. W., "Heuristic solutions to multi-depot location-routing problems, " Computers & Operations Research 29, 1393-1415 (2002).