A column generation approach for the maximal covering location problem

International Transactions in Operational Research

Volumn 14, Issue 4, 2007, Pages 349-364

  Pereira, Marcos Antonio ^a   Lorena, Luiz Antonio Nogueira ^b   Senne, Edson Luiz França ^a  

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

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Column generation; Facility location; Lagrangean surrogate relaxation

Indexed keywords

EID: 68949191944     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2007.00593.x     Document Type: Article

References (42)

1. Arakaki, R.G.I., Lorena, L.A.N., 2001. A constructive genetic algorithm for the maximal covering location problem. In: Proceedings of the 4th Metaheuristics International Conference (MIC'2001), 16–20 July, Porto, Portugal, pp. 13–17.
2. Briant, O., Lemaréchal, C., Meurdesoif, P.H., Michel, S., Perrot, N., Vanderbeck, F., 2005. Comparison of Bundle and Classical Column Generation. Rapport de recherche de l'INRIA 5453, Rhone-Alpes, France.
3. Church, R.L., ReVelle, C.S., 1974. The maximal covering location problem. Papers of the Regional Science Association 32, 101–118.
4. Dantzig, G.B., Wolfe, P., 1960. Decomposition principle for linear programs. Operations Research 8, 101–111.
5. Daskin, M., 1995. Network and Discrete Location: Models, Algorithms and Applications. Wiley Interscience, New York.
6. Day, P.R., Ryan, D.M., 1997. Flight attendant rostering for short-haul airline operations. Operations Research 45, 649–661.
7. Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) 2005. Column Generation. Springer, Berlin.
8. Desrosiers, J., Lübbecke, M.E., 2005. A primer in column generation. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds) Column Generation (GERAD 25th Anniversary Series). Springer Science+Business Media Inc., New York, pp. 1–32.
9. Desrochers, M., Soumis, F., 1989. A column generation approach to the urban transit crew scheduling problem. Transportation Science 23, 1–13.
10. Desrochers, M., Desrosiers, J., Solomon, M., 1992. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40, 342–354.
11. Drezner, Z. (ed.) 1995. Facility Location: A Survey of Applications and Methods. Springer-Verlag, New York.
12. Du Merle, O., Goffin, J.L., Vial, J.P., 1998. On improvements to the analytic centre cutting plane method. Computational Optimization and Applications 11, 37–52.
13. Fung, G., Mangasarian, O.L., 2000. Semi-supervised support vector machines for unlabeled data classification. Optimization Methods and Software 1, 15, 29–44.
14. Galvão, R.D., Espejo, L.G.A., Boffey, B., 2000. A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. European Journal of Operational Research 124, 377–389.
15. Garfinkel, R.S., Neebe, W., Rao, M.R., 1974. An algorithm for the m-median location problem. Transportation Science 8, 217–236.
16. Gilmore, P.C., Gomory, R.E., 1961. A linear programming approach to the cutting stock problem. Operations Research 9, 849–859.
17. Gilmore, P.C., Gomory, R.E., 1963. A linear programming approach to the cutting stock problem: Part II. Operations Research 11, 863–888.
18. Glover, F., 1968. Surrogate constraints. Operations Research 4, 741–749.
19. Hakimi, S.L., 1964. Optimum location of switching centers and the absolute centers and medians of a graph. Operations Research 12, 450–459.
20. Hansen, P., Jaumard, B., 1997. Cluster analysis and mathematical programming. Mathematical Programming 79, 191–215.
21. Hillsman, E.L., 1984. The p-median structure as a unified linear model for location-allocation analysis. Environment and Planning A 16, 305–318.
22. ILOG Inc. 2001. ILOG CPLEX 7.1. User's Manual. ILOG Inc., CPLEX Division, Mountain View, USA.
23. Lorena, L.A.N., Pereira, M.A., 2002. A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillsman's edition. International Journal of Industrial Engineering 9, 1, 57–67.
24. Lübbecke, M.E., Desrosiers, J., 2002. Selected topics in column generation. Les Cahiers du GERAD G-2002-64, Montreal, Canada.
25. Marquardt, D.W., 1963. An algorithm for least-squares estimation of nonlinear parameters. Journal of the Society for Industrial and Applied Mathematics 11, 2, 431–441.
26. Marsten, R.E., 1975. The use of the boxstep method in discrete optimization. Mathematical Programming Studies 3, 127–144.
27. Marsten, R.E., Hogan, W.W., Blankenship, J.W., 1975. The BOXSTEP method for large-scale optimization. Operations Research 23, 389–405.
28. Minoux, M., 1987. A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations. R.A.I.R.O. Recherche Opérationnelle 21, 2, 105–136.
29. Neame, P.J., 1999. Nonsmooth dual methods in integer programming, Ph.D. Thesis. University of Melbourne, Melbourne.
30. Parker, R.G., Rardin, R.L., 1988. Discrete Optimization. Academic Press, New York.
31. Rao, M.R., 1971. Cluster analysis and mathematical programming. Journal of the American Statistical Association 66, 622–626.
32. Schilling, D.A., Rosing, K.E., ReVelle, C.S., 2000. Network distance characteristics that affect computational effort in p-median location problems. European Journal of Operational Research 127, 525–536.
33. Senne, E.L.F., Lorena, L.A.N., 2000. Lagrangean/surrogate heuristics for p-median problems. In: Laguna, M., Gonzalez-Velarde, J.L. (eds) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer Academic Publishers, Dordrecht, pp. 115–130.
34. Senne, E.L.F., Lorena, L.A.N., 2001. Stabilizing column generation using Lagrangean/surrogate relaxation: an application to p-median location problems. In: European Operations Research Conference–EURO XVIII, 9–11 July, Erasmus University, Rotterdam, the Netherlands. Available for download at: http://www.lac.inpe.br/lorena/ejor/EURO2001.pdf
35. Souza, C.C., Menezes, C.N., 2000. Exact solutions of rectangular partitions via integer programming. International Journal on Computational Geometry and Applications 10, 5, 477–522.
36. Souza, C.C., Moura, A.V., Yunes, T.H., 2000a. Solving very large crew scheduling problems to optimality. In: Proceedings of the 14th ACM Symposium on Applied Computing, 19–21 March, Como, Italy, pp. 446–451.
37. Souza, C.C., Moura, A.V., Yunes, T.H., 2000b. A hybrid approach for solving large scale crew scheduling problems. In: Goos, G., Hartmanis, J., Van Leeuwen, J. (eds) Lecture Notes in Computer Sciences – Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages (PADL'00), Boston, USA, 1753. Springer Verlag, Berlin, pp. 293–307.
38. Swain, R.W., 1974. A parametric decomposition approach for the solution of uncapacitated location problems. Management Science 21, 955–961.
39. Toregas, C., Swain, R., ReVelle, C., Bergman, L., 1971. The location of emergency service facilities. Operations Research 19, 1363–1373.
40. Valério de Carvalho, J.M., 1999. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86, 629–659.
41. Vance, P.H., Barnhart, C., Johnson, E.L., Nemhauser, G.L., 1994. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3, 111–130.
42. Vinod, H.D., 1969. Integer programming and the theory of groups. Journal of the American Statistical Association 64, 506–519.