A column generation approach to capacitated p-median problems

Computers and Operations Research

Volumn 31, Issue 6, 2004, Pages 863-876

  Lorena, Luiz A N ^a   Senne, Edson L F ^b  

^a INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

^b SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

Author keywords

Capacitated p median problems; Column generation; Lagrangean surrogate relaxation; Location problems

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; DATA REDUCTION; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; PROBLEM SOLVING;

CAPACITATED P-MEDIAN PROBLEM (CPMP); OPTIMAL LOCATION;

OPERATIONS RESEARCH;

FACILITY LOCATION;

EID: 1142268986     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00039-X     Document Type: Article

References (36)

1. Bramel J. Simchi-Levi D. A location based heuristic for general routing problems Operations Research 43 1995 649-660
2. Klein K. Aronson J.E. Optimal clustering: a model and method Naval Research Logistics 38 1991 447-461
3. Mulvey J.M. Beck M.P. Solving capacitated clustering problems European Journal of Operational Research 18 1984 339-348
4. Osman I.H. Christofides N. Capacitated clustering problems by hybrid simulated annealing and tabu search International Transactions in Operational Research 1 1994 317-336
5. Koskosidis Y.A. Powell W.R. Clustering algorithms for consolidation of costumes orders into vehicle shipments Transportation Research B 26 1992 365-379
6. França P.M. Sosa N.M. Pureza V. An adaptive tabu search algorithm for the capacitated p-median problem International Transactions in Operations Research 6 1999 665-678
7. Maniezzo V. Mingozzi A. Baldaci R. A bionomic approach to the capacitated p-median problem Journal of Heuristics 4 1998 263-280
8. Lorena L.A.N. Furtado J.C. Constructive genetic algorithm for clustering problems Evolutionary Computation 9 1 2001 309-327
9. Beasley J.E. Or-library: distributing test problems by electronic mail Journal Operational Research Society 41 1990 1069-1072
10. Lorena L.A.N. Lopes F.B. A surrogate heuristic for set covering problems European Journal of Operational Research 79 1994 138-150
11. Lorena L.A.N. Narciso M.G. Relaxation heuristics for a generalized assignment problem European Journal of Operational Research 91 1996 600-610
12. Lorena L.A.N. Senne E.L.F. Improving traditional subgradient scheme for Lagrangean relaxation: an application to location problems International Journal of Mathematical Algorithms 1 1999 133-151
13. Lorena LAN, Senne ELF. Local search heuristics for capacitated p-median problems. Networks and Spatial Economics 2002, to appear.
14. Narciso M.G. Lorena L.A.N. Lagrangean/surrogate relaxation for generalized assignment problems European Journal of Operational Research 114 1999 165-177
15. Senne E.L.F. Lorena L.A.N. Lagrangean/surrogate heuristics for p-median problems Laguna M. Gonzalez-Velarde J.L. Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research 2000 115-130 Kluwer Academic Publishers Dordrecht
16. Cooper L. Location-allocation problems Operations Research 11 1963 331-343
17. Dantzig G.B. Wolfe P. Decomposition principle for linear programs Operations Research 8 1960 101-111
18. Barnhart C. Johnson E.L. Nemhauser G.L. Savelsbergh M.W.P. Vance P.H. Branch-and-price: column generation for solving huge integer programs Operations Research 46 1998 316-329
19. Carvalho JMV. Exact solution of bin-packing problems using column generation and branch-and-bound. Universidade do Minho, Departamento Produção e Sistemas. Working Paper, 1996.
20. Day P.R. Ryan D.M. Flight attendant rostering for short-haul airline operations Operations Research 45 1997 649-661
21. Desrochers M. Desrosiers J. Solomon M. A new optimization algorithm for the vehicle routing problem with time windows Operations Research 40 1992 342-354
22. Desrochers M. Soumis F. A column generation approach to the urban transit crew scheduling problem Transportation Science 23 1989 1-13
23. Gilmore P.C. Gomory R.E. A linear programming approach to the cutting stock problem Operations Research 9 1961 849-859
24. Gilmore P.C. Gomory R.E. A linear programming approach to the cutting stock problem-Part II Operations Research 11 1963 863-888
25. Vance P. Crew scheduling, cutting stock and column generation: solving huge integer programs. PhD thesis, Georgia Institute of Technology, 1993.
26. Vance P.H. Barnhart C. Johnson E.L. Nemhauser G.L. Solving binary cutting stock problems by column generation and branch-and-bound Computational Optimization and Applications 3 1994 111-130
27. Minoux M. A class of combinatorial problems with polynomially solvable large scale set covering/set partitioning relaxations RAIRO 21 2 1987 105-136
28. Kelley J.E. The cutting plane method for solving convex programs Journal of the SIAM 8 1960 703-712
29. du Merle O. Goffin J.L. Vial J.P. On improvements to the analytic centre cutting plane method Computational Optimization and Applications 11 1998 37-52
30. du Merle O. Villeneuve D. Desrosiers J. Hansen P. Stabilized column generation Discrete Mathematics 194 1999 229-237
31. Marsten R.M. Hogan W. Blankenship J. The Boxstep method for large-scale optimization Operations Research 23 1975 389-405
32. Neame PJ. Nonsmooth dual methods in integer programming. PhD thesis, Department of Mathematics and Statistics, The University of Melbourne, 1999.
33. Martello S. Toth P. Knapsack problems: algorithms and computer implementations 1990 Wiley New York
34. Reinelt G. The traveling salesman problem: computational solutions for TSP applications Lecture notes in computer science vol. 840 1994 Springer Berlin
35. ESRI Environmental Systems Research Institute, Inc. Avenue Customization and Application Development for ArcView, 1996.
36. ILOG CPLEX 6.5. ILOG Inc. Cplex Division, 1999.