EvoWorkshops 2008: Applications of Evolutionary Computing pp 659-668 | Cite as
Decentralized Evolutionary Optimization Approach to the p-Median Problem
Abstract
The facility location problem also known as p-median problem concerns the positioning of facilities such as bus-stops, broadcasting stations or supply stations in general. The objective is to minimize the weighted distance between demand points (or customers) and facilities. In general there is a trend towards networked and distributed organizations and their systems, complicating the design, construction and maintenance of distributed facilities as information is scattered among participants while no global view exists. There is a need to investigate distributed approaches to the p-median problem. This paper contributes to research on location problems by proposing an agent oriented decentralized evolutionary computation (EC) approach that exploits the flow of money or energy in order to realize distributed optimization. Our approach uses local operators for reproduction like mutation, recombination and selection finally regulated by market mechanisms. This paper presents two general outcomes of our model: how adaptation occurs in the number and strategies of agents leading to an improvement at the system level. The novelty of this approach lies in the biology-inspired bottom-up adaptation method for inherent distributed problems. It is applied to the uncapacitated p-median problem but is also intended to be general for a wide variety of problems and domains, e.g. wireless sensor networks.
Keywords
Evolutionary Algorithm Evolutionary Computation Random Search Facility Location Problem Demand PointPreview
Unable to display preview. Download preview PDF.
References
- 1.Durfee, E.H., Lesser, V.R., Corkill, D.D.: Trends in cooperative distributed problem solving. IEEE Transactions on Knowledge and Data Engineering 1(1), 63–83 (1989)CrossRefGoogle Scholar
- 2.Graudina, V., Grundspenkis, J.: Technologies and multi-agent system architectures for transportation and logistics support: An overview. In: International Conference on Computer Systems and Technologies - CompSysTech, Varna, Bulgaria (2005)Google Scholar
- 3.Cai, W., Turner, S.J., Gan, B.P.: Hierarchical federations: an architecture for information hiding. In: PADS 2001: Proceedings of the fifteenth workshop on Parallel and distributed simulation, pp. 67–74. IEEE Computer Society, Washington (2001)Google Scholar
- 4.Hohl, F.: A framework to protect mobile agents by using reference states. Technical Report 2000/03, Institut für Parallele und Verteilte Höchstleistungsrechner (IPVR) (March 2000)Google Scholar
- 5.Smith, R.E., Bonacina, C., Kearney, P., Eymann, T.: Integrating economics and genetics models in information ecosystems. In: Proceedings of the 2000 Congress on Evolutionary Computation CEC 2000, La Jolla Marriott Hotel La Jolla, 6-9 2000, pp. 959–966. IEEE Press, California (2000)Google Scholar
- 6.Eymann, T.: AVALANCE - Ein agentenbasierter dezentraler Koordinationsmechanismus für elektronische Märkte. PhD thesis, Universität Freiburg (2000)Google Scholar
- 7.Eiben, A., Schut, M.: New Ways to Calibrate Evolutionary Algorithms. In: Advanced in Metaheuristics and Optimization, Springer, Heidelberg (2007)Google Scholar
- 8.Hosage, C.M., Goodchild, M.F.: Discrete space location-allocation solutions from genetic algorithms. Annals of Operations Research 6(2), 35–46 (1986)CrossRefGoogle Scholar
- 9.Alp, O., Drezner, Z., Erkut, E.: An efficient genetic algorithm for the p-median problem. Annals of Operations Research 122(1-4), 21–42 (2003)MATHCrossRefMathSciNetGoogle Scholar
- 10.Galvão, R.D., ReVelle, C.: A lagrangean heuristic for the maximal covering location problem. European Journal of Operations Research 88, 114–123 (1996)MATHCrossRefGoogle Scholar
- 11.Goldberg, D.E.: Genetic Algorithms in search, optimization, and machine learning. Addison Wesley Longmann, Inc., Reading (1989)MATHGoogle Scholar
- 12.Smith, R.E., Taylor, N.: A framework for evolutionary computation in agent-based systems. In: Looney, C., Castaing, J. (eds.) Proceedings of the 1998 International Conference on Intelligent Systems, pp. 221–224. ISCA Press (1998)Google Scholar
- 13.Holland, J.H.: Hidden Order: How Adaptation Builds Complexity, vol. 9. Addison Wesley Publishing Company, Reading (1996)Google Scholar
- 14.Menczer, F., Degeratu, M., Street, W.: Efficient and scalable pareto optimization by evolutionary local selection algorithms. Evolutionary Comp 8(3), 223–247 (2000)CrossRefGoogle Scholar
- 15.Menczer, F., Belew, R.K.: Adaptive retrival agents: Internalizing local context and scaling up to the web. Mach. Learn. 39(2-3), 203–242 (2000)MATHCrossRefGoogle Scholar
- 16.Otto, S., Kirn, S.: Evolutionary adaptation in complex systems using the example of a logistics problem. International Transactions on Systems Science and Applications 2(2), 157–166 (2006)Google Scholar
- 17.Mühlenbein, H.: The breeder genetic algorithm - a provable optimal search algorithm and its application. In: Colloquium on Applications of Genetic Algorithms, IEEE, London, vol. 67, p. 5/1– 5/3, IEEE, London (1994)Google Scholar