A location-routing problem for the conversion to the "click-and-mortar" retailing: The static case

European Journal of Operational Research

Volumn 186, Issue 2, 2008, Pages 554-575

  Aksen, Deniz ^a   Altinkemer, Kemal ^b  

^a KOÇ UNIVERSITY   (Turkey)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Augmented Lagrangian relaxation; Click and mortar; Distribution; Location routing

Indexed keywords

ELECTRONIC COMMERCE; HEURISTIC METHODS; PROBLEM SOLVING; QUALITY OF SERVICE; SUPPLY CHAIN MANAGEMENT; WAREHOUSES;

AUGMENTED LAGRANGIAN RELAXATION; CLICK-AND-MORTAR; DISTRIBUTION; LOCATION ROUTING;

OPERATIONS RESEARCH;

EID: 35349020926     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.01.048     Document Type: Article

References (24)

1. Ahipaşaoǧlu, S.D., Erdoǧan, G., Tansel, B. 2003. Location-routing problems: A review and assessment of research directions, Working Paper IEOR 2003-07, Department of Industrial Engineering, Bilkent University: Ankara, Türkiye.
2. Aksen, D., Alti{dotless}nkemer, K., 2003. Efficient frontier analysis and heuristics for e-tailing logistics. Working Paper, Purdue University, Krannert Graduate School of Management: West Lafayette, Indiana, USA.
3. Albareda-Sambola M., Díaz J.A., and Fernández E. A compact model and tight bounds for a combined location-routing problem. Computers and Operations Research 32 3 (2005) 407-428
4. Ambrosino D., and Scutellà M.G. Distribution network design: New problems and related models. European Journal of Operational Research 165 3 (2005) 610-624
5. Campbell A.M., and Savelsbergh M.W.P. Decision support for consumer direct grocery initiatives. Transportation Science 39 3 (2005) 313-327
6. Cordeau J.F., Desaulniers G., Desrosiers J., Solomon M.M., and Soumis F. VRP with time windows. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem (2002), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia 157-193
7. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms. 2nd ed. (2001), The MIT Press (McGraw-Hill Book Company), Cambridge, Massachusetts
8. Cornuéjols G., Nemhauser L., and Wolsey L.A. The uncapacitated facility location problem. In: Mirchandani P., and Francis R. (Eds). Discrete Location Theory (1990), John Wiley and Sons, New York 117-119
9. Crainic T.G., and Laporte G. Planning models for freight transportation. European Journal of Operational Research 97 3 (1997) 409-438
10. Fisher M. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 1 (1981) 1-18
11. Garey G., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, New York
12. Gavish B. Augmented Lagrangean based algorithms for centralized network design. IEEE Transactions on Communications COM 33 12 (1985) 1247-1257
13. Geoffrion A.M. Lagrangian relaxation and its uses in integer programming. Mathematical Programming Study 2 (1974) 82-114
14. Hays T., Keskinocak P., and de López V.M. Strategies and challenges of Internet grocery retailing logistics. In: Geunes J., Akçali{dotless} E., Pardalos P.M., Romeijn H.E., and Shen Z.J. (Eds). Applications of Supply Chain Management and E-Commerce Research in Industry (2005), Kluwer Academic Publishers, The Netherlands 1-36
15. Jayaraman V., and Ross A. A simulated annealing methodology to distribution network design and management. European Journal of Operational Research 144 3 (2003) 629-645
16. Laporte G. Location-routing problems. In: Golden B.L., and Assad A.A. (Eds). Vehicle Routing: Methods and Studies (1988), North-Holland, The Netherlands 163-198
17. Melechovský J., Prins C., and Calvo R.W. A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics 11 5-6 (2005) 375-391
18. Min H., Jayaraman V., and Srivastava R. Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research 108 1 (1998) 1-15
19. Papadimitriou C.H. The complexity of the capacitated tree problem. Networks 8 (1978) 217-230
20. Salhi S., and Rand G.K. The effect of ignoring routes when locating depots. European Journal of Operational Research 39 2 (1989) 150-156
21. Toth P., and Vigo D. VRP with time windows. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem (2002), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia 29-51
22. Tüzün D., and Burke L.I. A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116 1 (1999) 87-99
23. Van Mieghem, J.A. 2001. PeaPod: Internet Grocer Strategies. Case by Kellogg Gradaute School of Management, Northwestern University.
24. Wu T.H., Low C., and Bai J.W. Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research 29 10 (2002) 1393-1415