Comparative analysis of modern optimization tools for the p-median problem
- 183 Downloads
- 7 Citations
Abstract
This paper develops a study on different modern optimization techniques to solve the p-median problem. We analyze the behavior of a class of evolutionary algorithm (EA) known as cellular EA (cEA), and compare it against a tailored neural network model and against a canonical genetic algorithm for optimization of the p-median problem. We also compare against existing approaches including variable neighborhood search and parallel scatter search, and show their relative performances on a large set of problem instances. Our conclusions state the advantages of using a cEA: wide applicability, low implementation effort and high accuracy. In addition, the neural network model shows up as being the more accurate tool at the price of a narrow applicability and larger customization effort.
Keywords
Evolutionary algorithms Cellular genetic algorithms Neural networks Optimization tools p-medianPreview
Unable to display preview. Download preview PDF.
References
- Alba E. and Tomassini M. 2002. Parallelism and Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 6(5): 443–462.CrossRefGoogle Scholar
- Alba E. and Troya J. M. 1999. A Survey of Parallel Distributed Genetic Algorithms. Complexity 4(4): 31–52.MathSciNetCrossRefGoogle Scholar
- Alba E. and Troya J. M. 2000. Cellular Evolutionary Algorithms: Evaluating the Influence of Ratio. In: M. S. (ed.). Parallel Problem Solving from Nature, PPSN VI, Vol. 1917 of Lecture Notes in Computer Science. pp. 29–38.Google Scholar
- Bartezzaghi E. and Colorni A. 1981. A search tree algorithm for plant location problems. European Journal of Operational Research 7: 371–379.MathSciNetCrossRefzbMATHGoogle Scholar
- Christofides N. and Beasley J. 1982. A tree search algorithm for the problem of p-medians. European Journal of Operational Research 10: 196–204.MathSciNetCrossRefzbMATHGoogle Scholar
- Domínguez E. and Muńoz J. 2002. An efficient neural network for the p-median problem. Lecture Notes in Artificial Intelligence 2527: 460–469.Google Scholar
- Drezner Z. and Guyse J. 1999. Application of decision analysis to the Weber facility location problem. European Journal of Operational Research 116: 69–79.CrossRefzbMATHGoogle Scholar
- Erlenkotter D. 1978. A dual-bounded procedure for uncapacitated facility location. Operations Research 26(6): 992–1009.zbMATHMathSciNetGoogle Scholar
- Galvao R. D. 1980. A dual-bounded algorithm for the problem of p-medians. Operations Research 28: 1112–1121.zbMATHMathSciNetGoogle Scholar
- García-López F., Melián-Batista B., Moreno-Pérez J. A., and Moreno-Vega J. M. 2003. Parallelization of the Scatter Search for the p-median Problem. Parallel Computing 29: 575–589.CrossRefGoogle Scholar
- Garey M. and Johnson D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W. H. Freeman and Co.zbMATHGoogle Scholar
- Goldberg D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.Google Scholar
- Hansen P., Mladenovic N. and Taillard E. 1998. Heuristic solution of the multisource Weber problem ace to problem of p-medians. Operations Research Letters 22: 55–62.MathSciNetCrossRefzbMATHGoogle Scholar
- Holland J. H. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor, Michigan: The University of Michigan Press.Google Scholar
- Hribara M. and Daskin M. S. 1997. A dynamic programming heuristic for the problem of p-medians. European Journal of Operational Research 101: 499–508.CrossRefGoogle Scholar
- Kariv O. and Hakimi S. 1979. An Algorithmic Approach to Network Location Problem. Part 2: The p-Median. SIAM J. Appl. Math. 37: 539–560.MathSciNetCrossRefzbMATHGoogle Scholar
- Khumawala B. M. 1972. An efficient branch and bound algorithm for the warehouse location problem. Management Science 18(12): 718–731.Google Scholar
- Khuri S., Bäck T. and Heitkötter J. 1994. An Evolutionary Approach to Combinatorial Optimization Problems. In: Proceedings of the 22nd ACM Computer Science Conference. Phoenix, Arizona, pp. 66–73.Google Scholar
- Lozano S., Guerrero F., Onieva L. and Larrańeta J. 1998. Kohonen maps for solving to class of location-allocation problems. European Journal of Operational Research 108: 106–117.CrossRefzbMATHGoogle Scholar
- Manderick B. and Spiessens P. 1989. Fine-grained parallel genetic algorithms. In: Schaffer J. D. (ed.), Proceedings of the Third International Conference on Genetic Algorithms. pp. 428–433.Google Scholar
- Narula S. C., Ogbu U. I. and Samuelsson H. M. 1977. An algorithm for the problem of p-medians. Operations Research 25: 709–713.MathSciNetCrossRefzbMATHGoogle Scholar
- Nogueira L. A. and Furtado J. C. 2001. Constructive genetic algorithm for clustering problems. Evolutionary Computation 9(3): 309–328.CrossRefGoogle Scholar
- Ohlemüller M. 1997. Taboo search for large location-allocation problems. Journal of the Operational Research Society 48: 745–750.zbMATHCrossRefGoogle Scholar
- Reinelt G. 1991. TSP-Lib a travelling salesman library. ORSA Journal of Computing 3: 376–384. http://www.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB95/.Google Scholar
- ReVelle C. and Swain R. 1970. Central facilities location. Geographical Analysis 2: 30–42.CrossRefGoogle Scholar
- Rolland E., Shilling D. A., and Current J. R. 1996. An efficient tabu search procedure for the p-median problem. European Journal of Operational Research 96: 329–342.CrossRefGoogle Scholar
- Syswerda G. 1991. A Study of Reproduction in Generational and Steady-State Genetic Algorithms. In: Rawlins G. J. E. (ed.), Foundations of Genetic Algorithms. pp. 94–101.Google Scholar