A Bilevel Genetic Algorithm for a real life location routing problem

International Journal of Logistics Research and Applications

Volumn 11, Issue 1, 2008, Pages 49-65

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Bilevel genetic Algorithm; Bilevel programming; Location routing problem; Logistics; Metaheuristics

Indexed keywords

EID: 50149094499     PISSN: 13675567     EISSN: 1469848X     Source Type: Journal    
DOI: 10.1080/13675560701410144     Document Type: Article

References (29)

1. Ballou, R. H. (1999) Business Logistics Management, Planning, Organizing and Controlling the Supply Chain, Prentice-Hall International, Inc, Upper Saddle River, New Jersey
2. Chan, Y., Carter, W. B. and Burnes, M. B. (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput. Oper. Res., 28, pp. 803-826.
3. Christofides, N. and Eilon, S. (1969) An algorithm for the vehicle dispatching problem. Oper. Res. Quar., 20, pp. 309-318.
4. Christofides, N. and Eilon, S. (1969) Expected distances for distribution problems. Oper. Res. Quar., 20, pp. 437-443.
5. Daskin, M. (1995) Network and Discrete Location. Models, Algorithms and Applications, John Wiley and Sons, New York
6. Gaskell, T. J. (1967) Bases for vehicle fleet scheduling. Oper. Res. Quar., 18, pp. 281-295.
7. Jacobsen, S. K. and Madsen, O. B. G. (1980) A comparative study of heuristics for two level routing location problem. Euro. J. Oper. Res., 5, pp. 378-387.
8. Laporte, G. Location routing problems. Vehicle Routing: Methods and Studies, pp. 163-198. Elsevier, North Holland, Amsterdam
9. Laporte, G., Nobert, Y. and Pelletier, P. (1983) Hamiltonian location problems. Euro. J. Oper. Res., 12:1, pp. 82-89.
10. Laporte, G., Nobert, Y. and Taillefer, S. (1988) Solving a family of multi-depot vehicle routing and location routing problems. Trans. Sci., 22, pp. 161-172.
11. Madsen, O. B. G. (1983) Methods for solving combined two level location routing problems of realistic dimension. Euro. J. Oper. Res., 12, pp. 295-301.
12. Marinakis, Y. (2005) Vehicle routing in distribution problems, Technical University of Crete, Department of Production Engineering and Management, Chania, Greece
13. Marinakis, Y. and Marinaki, M. (2006) Expanding neighborhood search for the capacitated facility location problem. J. Ind. Manag. Optim.
14. Marinakis, Y., Migdalas, A. and Pardalos, P. M. (2005) Expanding neighborhood GRASP for the traveling salesman problem. Comput. Optim. Appl., 32, pp. 231-257.
15. Marinakis, Y., Migdalas, A. and Pardalos, P. M. (2005) A hybrid genetic-GRASP algorithm using langrangean relaxation for the traveling salesman problem. J. Comb. Optim., 10, pp. 311-326.
16. Marinakis, Y., Migdalas, A. and Pardalos, P. M. (2006) Multiple phase neighborhood search GRASP based on lagrangean relaxation and random backtracking lin-kernighan for the traveling salesman problem. Optim. Methods Softw.
17. Marinakis, Y., Marinaki, M. and Migdalas, A. (2006) Expanding neighborhood search for the vehicle routing problem. Cent. Eur. J. Oper. Res.
18. Migdalas, A. (1995) Bilevel programming in traffic planning: Models, methods and challenge. J. Glob. Optim., 7, pp. 381-405.
19. Migdalas, A. and Pardalos, P. (1995) Nonlinear bilevel problems with convex second level problem-heuristics and descent methods. Operations Research and its Application, pp. 194-204. World Scientific, Singapore
20. Miller, T. (2001) Hierarchical Operations and Supply Chain Planning, Springer-Verlag, London
21. Min, H., Jayaraman, V. and Srivastava, R. (1998) Combined location-routing problems: A synthesis and future research directions. Euro. J. Oper. Res., 108, pp. 1-15.
22. Nagy, G. and Salhi, S. (2007) Location-routing: Issues, models and methods. Euro. J. Oper. Res., 177, pp. 649-672.
23. Or, I. (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL
24. Perl, J. and Daskin, M. S. (1985) A warehouse location routing model. Transp. Res. B, 19, pp. 381-396.
25. Resende, M. G. C. and Ribeiro, C. C. (2003) Greedy randomized adaptive search procedures. Handbook of Metaheuristics, pp. 219-249. Kluwer Academic Publishers, Boston
26. Rochat, Y. and Taillard, E. D. (1995) Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics, 1, pp. 147-167.
27. Tuzun, D. and Burke, L. I. (1999) A two-phase tabu search approach to the location routing problem. Euro. J. Oper. Res., 116, pp. 87-99.
28. Watson-Gandy, C. T. D. and Dohrn, P. J. (1973) Depot location with van salesman-a practical approach. Omega, 1, pp. 321-329.
29. Wu, T. H., Low, C. and Bai, J. W. (2002) Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res., 29, pp. 1393-1415.