Heuristic procedures for solving the discrete ordered median problem

Annals of Operations Research

Volumn 136, Issue 1, 2005, Pages 145-173

  Domínguez Marín, Patricia ^a   Nickel, Stefan ^b   Hansen, Pierre ^c   Mladenović, Nenad ^c  

^a SAP RESEARCH   (Germany)

^b FRAUNHOFER INSTITUTE FOR INDUSTRIAL MATHEMATICS ITWM   (Germany)

^c GERAD   (Canada)

Author keywords

Discrete facility location; Genetic algorithms; Variable neighborhood search

Indexed keywords

EID: 18844362644     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-2043-3     Document Type: Conference Paper

References (42)

1. Alander, J. (1992). "On Optimal Population Size of Genetic Algorithms." In Proceedings of CompEuro, Vol. 92, IEEE Computer Society Press, Silverspring, MD, pp. 65-70.
2. Bäck, T., F. Hoffmeister, and H. Schwefel. (1991). "A Survey of Evolution Strategies." In R. Belew and L. Booker (eds.), Genetic Algorithms, Proceedings of the Fourth International Conference, Morgan Kaufmann, San Mateo, CA, pp. 2-9.
3. Beasley, J. (1985). "Solving Large p-Median Problems." European Journal of Operational Research 21, 270-273.
4. Beasfey, J. (1990). "OR-Library: Distributing Test Problems by Electronic Mail." Journal of the Operational Research Society 41(11), 1069-1072.
5. Boland, N., P. Domínguez-Marín, S. Nickel, and J. Puerto. (2003). "Exact Procedures for Solving the Discrete Ordered Median Problem." ITWM Bericht 47, Fraunhofer Institut für Techno- und Wirtschaftsmathematik (ITWM), Kaiserslautern, Germany.
6. Booker, L. (1987). Genetic Algorithms and Simulated Annealing, Chapt. Improving Search in Genetic Algorithms, Morgan Kauffmann, pp. 61-73.
7. Bozkaya, B., J. Zhang, and E. Erkut. (2002). Chapt. An Efficient Genetic Algoithm for thep-Median Problem, Springer, pp. 179-205.
8. Daskin, M. (1995). Network and Discrete Location: Models, Algorithms, and Applications. Wiley.
9. Davis, L. (ed.). (1987). Genetic Algorithms and Simulated Annealing. Morgan Kaufmann Publishers, San Mateo, CA.
10. Davis, L. (ed.). (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.
11. Dawkins, R. (1989). The Selfish Gene. Oxford University Press, second edition.
12. Drezner, Z. and H. Hamacher. (eds.). (2002). Facility Location: Applications and Theory. Springer Berlin Heidelberg New York.
13. Elloumi, S., M. Labbé, and Y. Pochet. (2004). "A New Formulation and Resolution Method for the p-Center Problem." INFORMS Journal on Computing 16(1), 84-94.
14. Fairly, A. (1991). Comparison of Methods of Choosing the Crossover Point in the Genetic Crossover Operation. Department of Computer Science, University of Liverpool.
15. Francis, R., T. Lowe, and A. Tamir. (2000). "Aggregation Error Bounds for a Class of Location Models." Operations Research 48, 294-307.
16. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, MA.
17. Hansen, P. and N. Maldenović. (2001). "Developments of Variable Neighborhood Search." In C. Ribeiro and P. Hansen (eds.), Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, pp. 415-439.
18. Hansen, P., N. Maldenović, and D. Pérez-Brito. (2001). "Variable Neighborhood Decomposition Search." Journal of Heuristics 7, 335-350.
19. Hansen, P. and N. Mladenović. (1997). "Variable Neighborhood Search for the p-Median." Location Science 5(4), 207-226.
20. Hansen, P. and N. Mladenović. (2001a). "Variable Neighborhood Search." In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics. A preliminary version is available at http://smg.ulb.ac.be/ Preprints/Hansen01_02.html.
21. Hansen, P. and N. Mladenović. (2001b). "Variable Neighborhood Search: Principles and Applications." European Journal of Operations Research 130(3), 449-467.
22. Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
23. Hosage, C. and M. Goodchild. (1986). "Discrete Space Location-Allocation Solutions form Genetic Algorithms." Annals of Operations Research 6, 35-46.
24. Jaramillo, J., J. Bhadury, and R. Batta. (2002). "On the Use of Genetic Algorithms to Solve Location Problems." Computers and Operations Research 29, 761-779.
25. Kalcsics, J., S. Nickel, and J. Puerto. (2003). "Multifacility Ordered Median Problems on Networks: A Further Analysis." Networks 41(1), 1-12.
26. Kalcsics, J., S. Nickel, J. Puerto, and A. Tamir. (2002). "Algorithmic Results for Ordered Median Problems Defined on Networks and the Plane." Operations Research Letters 30, 149-158.
27. Kariv, O. and S. Hakimi. (1979). "An Algorithmic Approach to Network Location Problems. II: The p-Medians." SIAM Journal on Applied Mathematics 37, 539-560.
28. Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, third edition.
29. Mirchandani, P. and R. Francis. (1990). Discrete Location Theory. Wiley, New York, NY.
30. Mladenović, N. (1995). "A Variable Neighborhood Algorithm - A New Metaheuristic for Combinatorial Optimization." Abstracts of papers presented at Optimization Days, Montréal, p. 112.
31. Mladenović, N. and P. Hansen. (1997). "Variable Neighbourhood Search." Computers and Operations Research 24, 1097-1100.
32. Mladenović, N., M. Labbé, and P. Hansen. (2003). "Solving the p-Center Problem by Tabu Search and Variable Neighborhood Search." Networks 42, 48-64.
33. Moreno Pérez, J., J. Roda García, and J. Moreno Vega. (1994). "A Parallel Genetic Algorithm for the Discrete p-Median Problem." In Studies in Locational Analysis, Vol. 7, pp. 131-141.
34. Moreno Vega, J. (1996). "Metaheurísticas en Localización: Análisis Teórico y Experimental." Ph.D. thesis, University of La Laguna. (In Spanish).
35. Nickel, S. (2001). "Discrete Ordered Weber Problems." In B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, and U. Rieder (eds.), Operations Research Proceedings 2000, Springer, pp. 71-76.
36. Nickel, S. and J. Puerto. (1999). "A Unified Approach to Network Location Problems." Networks 34, 283-290.
37. Ogryczak, W. (1994). "On the Lexicographic Minimax Approach to Location-Allocation Problems." Technical Report.
38. Puerto, J. and F. Fernández. (1995). "The Symmetrical Single Facility Location Problem." Technical Report, Faculty of Mathematics, University of Sevilla.
39. Puerto, J. and F. Fernández. (2000). "Geometrical Properties of the Symmetrical Single Facility Location Problem." Journal of Nonlinear and Convex Analysis 1(3), 321-342.
40. Rodríguez-Chía, A., S. Nickel, J. Puerto, and F. Fernández. (2000). "A Flexible Approach to Location Problems." Mathematical Methods of Operations Research 51, 69-89.
41. Schwefel, H. (1981). Numerical Optimization of Computer Models. Wiley, Chichester.
42. Whitaker, R. (1983). "A Fast Algorithm for the Greedy Interchange for Large-Scale Clustering and Median Location Problems." INFOR 21, 95-108.