A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem

Computers and Operations Research

Volumn 38, Issue 8, 2011, Pages 1109-1116

  Albareda Sambola, Maria ^a   Fernndez, Elena ^a   Laporte, Gilbert ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b HEC MONTRÉAL   (Canada)

Author keywords

Discrete location

Indexed keywords

CAPACITY CONSTRAINTS; COMPUTATIONAL COMPARISONS; COMPUTATIONAL EXPERIMENT; DISCRETE LOCATION; EXACT SOLUTION; PLANT LOCATIONS; ROUND TRIP; VALID INEQUALITY;

LOCATION;

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

References (15)

1. M. Albareda-Sambola, E. Fernndez, and G. Laporte Capacity and distance constrained plant location problem Computers & Operations Research 36 2009 597 611
2. J. Barcel, E. Fernndez, and K. Jrnsten Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem European Journal of Operational Research 53 1991 38 45
3. M. Campêlo, V.A. Campos, and R.C. Corrêa On the asymmetric representatives formulation for the vertex coloring problem Discrete Applied Mathematics 156 2008 1097 1111
4. D. Catanzaro, A. Godi, and M. Labb A class representative model for pure parsimony haplotyping INFORMS Journal on Computing 22 2010 195 209
5. H. Crowder, E.L. Johnson, and M.W. Padberg Solving large-scale zero-one linear programming problems Operations Research 31 1983 803 834
6. Dash Optimization Xpress-MP Optimization subroutine library. Dash associates 2007 Blisworth House Blisworth, UK
7. J.A. Daz, and E. Fernndez A branch and price algorithm for the single source capacitated plant location problem Journal of the Operational Research Society 53 2002 728 748
8. M.M. Fazel-Zarandi, and J.C. Beck Solving a location-allocation problem with logic-based benders decomposition Lecture Notes in Computer Science 5732 2009 344 351
9. S.P. Fekete, and J. Schepers New classes of lower bounds for the bin packing problem Mathematical Programming 91 2001 11 31
10. Fischetti M, Salazar-Gonzlez JJ, Toth P. Experiments with a multi-commodity formulation for the symmetric capacitated vehicle routing problem. In: Proceedings of the 3rd Meeting of the EURO working group on transportation, Barcelona; 1995. p. 16973.
11. ILOG CPLEX 10.0 user's manual. ILOG, Inc., Incline Village, Nevada, 2006.
12. G. Laporte Location-routing problems B.L. Golden, A.A. Assad, Vehicle routing: methods and studies 1988 North-Holland Amsterdam 163 197
13. S. Martello, and P. Toth Knapsack problems: algorithms and computer implementations 1990 John Wiley and Sons Chichester
14. S. Martello, and P. Toth Lower bounds and reduction procedures for the bin packing problem Discrete Applied Mathematics 28 1990 59 70
15. G. Nagy, and S. Salhi Location-routing: issues, models and methods European Journal of Operational Research 177 2007 649 672