A two echelon location-routing model with considering Value-at-Risk measure

References

• Albareda-Sambola , M. , Diaz , J. and Fernandez , E. 2005 . A compact model and tight bounds for a combined location routing problem . Computers and Operations Research , 32 : 407 – 428 .
   Web of Science ®Google Scholar
• Baita F. et al. Dynamic routing-and-inventory problem: A review Transportation Research A 1998 32 585 598
   Google Scholar
• Branco , I. and Coelho , J. 1990 . The hamiltonian p-median problem . European Journal of Operational Research , 47 : 86 – 95 .
   Google Scholar
• Duhamel C. et al. A GRASPELS approach for the capacitated location-routing problem Computers and Operations Research 2009 Article in press, DOI: 10.1016/j.cor.2009.07.004
   Google Scholar
• Hansen , P. and Hegedahl , B. 1994 . A heuristic solution to the warehouse location-routing problem . European Journal of Operational Research , 76 : 111 – 127 .
   Web of Science ®Google Scholar
• Jamil , M. , Batta , R. and Malon , D. 1994 . The traveling repairperson home base location problem . Transportation Science , 28 : 150 – 161 .
   Web of Science ®Google Scholar
• Laporte , G. and Nobert , Y. 1981 . An exact algorithm for minimizing routing and operating cost in depot location . European Journal of Operational Research , 6 : 224 – 226 .
   Web of Science ®Google Scholar
• Laporte , G. , Nobert , Y. and Arpin , D. 1986 . An exact algorithm for solving a capacitated location-routing problem . Annals of Operations Research , 6 : 293 – 310 .
   Google Scholar
• Laporte , G. , Nobert , Y. and Pelletier , P. 1983 . Hamiltonian location problems . European Journal of Operational Research , 12 : 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 . Transportation Science , 22 : 161 – 172 .
   Web of Science ®Google Scholar
• Lin , C. , Chow , C. and Chen , A. 2002 . A location-routing loading problem for bill delivery services . Computers and Industrial Engineering , 43 : 5 – 25 .
   Web of Science ®Google Scholar
• Liu , S. and Lee , S. 2003 . A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into considerations . International Journal of Advanced Manufacturing Technology , 22 : 941 – 950 .
   Web of Science ®Google Scholar
• Min , H. , Jayaraman , V. and Srivastava , R. 1998 . Combined location-routing problems: A synthesis and future research directions . European Journal of Operational Research , 108 : 1 – 15 .
   Web of Science ®Google Scholar
• Nagy , G. and Salhi , S. 2007 . Location-routing, issues, models, and methods: A review . European Journal Of Operational Research , 117 : 649 – 672 .
   Web of Science ®Google Scholar
• Or , I. and Pierskalla , W. 1979 . A transportation location-allocation model for regional blood banking . AIIE Transactions , 11 ( 2 ) : 86 – 95 .
   Web of Science ®Google Scholar
• Perl , J. and Daskin , M. 1985 . A warehouse location-routing problem . Transportation Research B , 19 : 381 – 396 .
   Google Scholar
• Salhi , S. and Nagy , G. 1999 . Consistency and robustness in location routing . Studies in Locational Analysis , 13 : 3 – 19 .
   Google Scholar
• Schwardt , M. and Fischer , K. 2009 . Combined location-routing problems—A neural network approach . Annals of Operations Research , 167 ( 1 ) : 253 – 269 .
   Google Scholar
• Skiscim , C. and Golden , B. 1983 . “ Optimization by simulated annealing: a preliminary computational study for the tsp ” . In Winter Simulation Conference In
   Google Scholar
• Tuzun , D. and Burke , L. 1999 . A two-phase Tabu search approach to the location routing problem . European Journal of Operational Research , 116 : 87 – 99 .
   Web of Science ®Google Scholar
• Wang , K. and Wu , M. 2009 . DBLAR: A distance-based location-aided routing for MANET . Journal of Electronics , 26 ( 2 ) : 152 – 160 .
   Google Scholar
• Wu , T. , Low , C. and Bai , J. 2002 . Heuristic solution to multi depot location-routing problems . Computers and Operations Research , 29 : 1393 – 1415 .
   Web of Science ®Google Scholar