The capacity and distance constrained plant location problem

Computers and Operations Research

Volumn 36, Issue 2, 2009, Pages 597-611

  Albareda Sambola, Maria ^a   Fernández, Elena ^a   Laporte, Gilbert ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b HEC MONTRÉAL   (Canada)

Author keywords

Bin packing; Location allocation; Tabu search

Indexed keywords

CUSTOMER SATISFACTION; HEURISTIC PROGRAMMING; LEARNING ALGORITHMS; SALES; SOLUTIONS; TABU SEARCH; VEHICLES;

BIN PACKING; COMPUTATIONAL TESTING; LOCATION-ALLOCATION; MODELING ASPECTS; NEAR-OPTIMAL SOLUTIONS; PAPER ADDRESSES; PLANT LOCATIONS; ROUND TRIPS; TABU SEARCH ALGORITHM; TWO TYPES;

LOCATION;

EID: 52049105250     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.10.017     Document Type: Article

References (14)

1. Mirchandani P.B., and Francis R.L. Discrete location theory (1990), Wiley, Chichester
2. Daskin M.S. Network and discrete location: models, algorithms, and applications (1995), Wiley, New York
3. Laporte G. Location-routing problems. In: Golden B.L., and Assad A.A. (Eds). Vehicle routing: methods and studies (1988), North-Holland, Amsterdam 163-197
4. Berman O., Jaillet P., and Simchi-Levi D. Location-routing problems with uncertainty. In: Drezner Z. (Ed). Facility location: a survey of applications and methods (1995), Springer, New York 427-453
5. Min H., Jayaraman V., and Srivastava R. Combined location-routing problems: a synthesis and future research directions. European Journal of Operational Research 108 (1998) 1-15
6. Nagy G., and Salhi S. Location-routing: issues, models and methods. European Journal of Operational Research 177 (2007) 649-672
7. Glover F. Tabu search: Part I. ORSA Journal of Computing 1 (1989) 190-206
8. Glover F. Tabu search: Part II. ORSA Journal of Computing 2 (1990) 4-32
9. Gendreau M., Hertz A., and Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276-1290
10. Scholl A., Klein R., and Jürgens C. BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research 24 (1997) 627-645
11. Delmaire H., Díaz J.A., Fernández E., and Ortega M. Reactive grasp and tabu search based heuristics for the single source capacitated plant location problem. INFOR 37 (1999) 194-225
12. Díaz J.A., and Fernández E. A tabu search heuristic for the generalized assignment problem. European Journal of Operational Research 132 (2001) 22-38
13. Albareda-Sambola M., Díaz J.A., and Fernández E. A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research 32 (2005) 407-428
14. Barceló J., Fernández E., and Jörnsten K. Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem. European Journal of Operational Research 53 (1991) 38-45