A decomposition approach for the probabilistic maximal covering location-allocation problem

Computers and Operations Research

Volumn 36, Issue 10, 2009, Pages 2729-2739

  Corrêa, Francisco de Assis ^a   Lorena, Luiz Antonio Nogueira ^a   Ribeiro, Glaydston Mattos ^b  

^a INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

^b FEDERAL UNIVERSITY OF ESPÍRITO SANTO   (Brazil)

Author keywords

Column generation; Congested systems; Lagrangean relaxation; Location problems

Indexed keywords

SERVERS;

COLUMN GENERATION; COMPUTATIONAL TESTS; COMPUTATIONAL TIME; CONGESTED SYSTEMS; DECOMPOSITION APPROACHES; LAGRANGEAN RELAXATION; LOCATION ALLOCATIONS; LOCATION PROBLEMS; LOCATION-ALLOCATION PROBLEMS; MAXIMAL COVERING LOCATION PROBLEMS; OPTIMALITY; PROBABILISTIC MODELS; QUEUE LENGTHS; SERVICE CENTERS; SOLUTION PROCEDURES; TRAVEL DISTANCES; WAITING-TIME;

SITE SELECTION;

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

References (36)

1. Church R.L., and ReVelle C. Maximal covering location problem. Papers of the Regional Science Association 32 (1974) 101-118
2. Eaton D., Hector M., Sanchez V., Latingua R., and Morgan J. Determining ambulance deployment in Santo Domingo, Dominican Republic. Journal of the Operational Research Society 37 (1986) 113-126
3. Current J.R., and O'Kelly M. Locating emergency warning sirens. Decision Sciences 23 1 (1992) 221-234
4. Moore G.C., and ReVelle C.S. The hierarchical service location problem. Management Science 28 7 (1982) 775-780
5. Hougland E.S., and Stephens N.T. Air pollutant monitor sitting by analytical techniques. Journal of the Air Pollution Control Association 26 (1976) 52-53
6. Marianov V., and Serra D. Probabilistic maximal covering location-allocation models for congested systems. Journal of Regional Science 38 3 (1998) 401-424
7. Marianov V., and Serra D. Hierarchical location-allocation models for congested systems. European Journal of Operational Research 135 (2001) 195-208
8. Daskin M.S. Network and discrete location: models, algorithms and applications (1995), Wiley, New York
9. Galvão R.D., and ReVelle C.S. A Lagrangean heuristic for the maximal covering location problem. European Journal of Operational Research 88 (1996) 114-123
10. Lorena L.A.N., and Pereira M.A. A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillsman's edition. International Journal of Industrial Engineering 9 (2002) 57-67
11. Pereira M.A., Lorena L.A.N., and Senne E.L.F. A column generation approach for the maximal covering location problem. International Transactions in Operations Research 75 (2007) 81-102
12. Chung C.H. Recent applications of the maximal covering location problem (MCLP) model. Journal of the Operational Research Society 37 (1986) 735-746
13. Hale T.S., and Moberg C.R. Location science review. Annals of Operations Research 123 (2003) 21-35
14. Serra D, Marianov V. New trends in public facility location modelling. Universitat Pompeu Fabra Economics and Business Working Paper 755. Available at 〈http://www.econ.upf.edu/docs/papers/downloads/755.pdf〉, 2004.
15. Galvão R.D. Uncapacitated facility location problems: contributions. Pesquisa Operacional 24 (2004) 7-38
16. ReVelle C., and Hogan K. The maximum availability location problem. Transportation Science 23 (1989) 192-200
17. Marianov V., and ReVelle C. The queueing maximal availability location problem: a model for siting of emergency vehicles. European Journal of Operational Research 93 (1996) 110-120
18. Brotcorne L., Laporte G., and Semet F. Ambulance location and relocation models. European Journal of Operational Research 147 (2003) 451-463
19. Pirkul H., and Schilling D.A. The maximal covering location problem with capacities on total workload. Management Science 37 2 (1991) 233-248
20. Corrêa F.A., and Lorena L.A.N. Aplicação da relaxação lagrangeana e do algoritmo genético construtivo na solução do problema probabilístico de localização-alocação de máxima cobertura (Using the Lagrangean relaxation and the constructive genetic algorithm for solving the probabilistic maximal covering location-allocation problem). Gestão & Produção 13 (2005) 233-244
21. Corrêa FA, Lorena LAN. Using the constructive genetic algorithm for solving the probabilistic maximal covering location-allocation problem. In: Workshop on computational intelligence/SBRN. Available at 〈http://www.lac.inpe.br/∼lorena/correa/Correa_Lorena_Wci_2006.p df〉, 2006.
22. Lorena L.A.N., and Furtado J.C. Constructive genetic algorithm for clustering problems. Evolutionary Computation 9 3 (2001) 309-327
23. Corrêa FA, Chaves AA, Lorena LAN. Hybrid heuristics for the probabilistic maximal covering location-allocation problem. Operational Research-An International Journal 2007, to appear.
24. Oliveira A.C.M., and Lorena L.A.N. Detecting-promising areas by evolutionary clustering search. Advances in Artificial Intelligence Series 3171 (2004) 385-394
25. Oliveira A.C.M., and Lorena L.A.N. Population training heuristics. Lecture notes in computer science vol. 3448 (2005), Springer, Berlin 166-176
26. Oliveira A.C.M., and Lorena L.A.N. Hybrid evolutionary algorithms and clustering search. In: Grosan C., Abraham A., and Ishibuchi H. (Eds). Springer SCI series vol. 14 (2007), Springer, Berlin 349-364
27. Ribeiro GM, Lorena LAN. Optimizing the woodpulp stowage using Lagrangean relaxation with clusters. Journal of the Operational Research Society 2008;59:600-6.
28. Ribeiro G.M., and Lorena L.A.N. Lagrangean relaxation with clusters and column generation for the manufacture's pallet loading problem. Computers & Operations Research 34 (2007) 2695-2708
29. Ribeiro G.M., and Lorena L.A.N. Lagrangean relaxation with clusters for point-feature cartographic label placement problems. Computers & Operations Research 35 (2008) 2129-2140
30. Atamtürk A., Nemhauser G.L., and Savelsbergh M.W.P. Conflict graphs in solving integer programming problems. European Journal of Operational Research 121 (2000) 40-55
31. Larson R.C., and Odoni A.R. Urban operations research (1981), Prentice-Hall, Englewood Cliffs, NJ
32. Bazaara M.S., Jarvis J.J., and Sherali H.D. Linear programming and network flows (1990), Wiley, New York
33. Desrosiers J., and Lübbecke M.E. A primer in column generation. In: Desaulniers G., Desrosiers J., and Solomon M.M. (Eds). Column generation (GERAD 25th anniversary series) (2005), Springer Science PL Business Media Inc., New York 1-32
34. ILOG CPLEX 10.0, User's manual, France, 2006.
35. Karypis G., and Kumar V. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing 48 1 (1998) 96-129
36. Senne E.L.F., Lorena L.A.N., and Pereira M.A. A branch-and-price approach to p-median problems. Computers & Operations Research 32 (2005) 1655-1664