A Bilevel Genetic Algorithm for a real life location routing problem

References

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