Abstract
This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is proposed and mechanisms for controlling the interactions of agents are investigated. The control mechanism used in the final solution is based on the concept of agents submitting bids to receive work. The agents are also allowed to alter their bidding strategies as the solution improves. The MAS solves the test problem is solved, which previously could not be solved within the hard constraints.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jeyakesavan V A Balaji R. A 3/2-approximation algorithm for the mixed postman problem. SIAM Journal on Discrete Mathematics, 12(4), 1999.
T. Bousonville. Local search and evolutionary computation for arc routing in garbage collection. In et al Spector L, editor, Proceedings of the Genetic and Evolutionary Computation Conference 2001. Morgan Kaufman Publishers, 2001.
Bruten J Cli. D. Simple bargaining agents for decentralised market-based control. Technical Report HPL-98-17, Hewlet Packard Laboritories., Bristol. United Kingdom., 1998.
Han C. Kang M. Solving the rural postman problem using a genetic algorithm with a graph transformation. In Proceedings of the 1998 ACM Symposium on Applied Computing. ACM Press, 1998.
Ramdane-Cherif W A Lacomme P, Prins C. A genetic algorithm for the capacitated arc routing problem. In Boers E J W et al., editor, Real World Applications of Evolutionary Computing. Springer-Verlag, 2001.
Wellman M P. A market orientated programming environment and its application to distributed multi-commodity flow problems. Journal of Artificial Intelligence Research. Morgan Kaufmann Publishers, 1, 1993.
Chisholm K Urquhart N, Paechter B. Street based routing using an evolutionary algorithm. In Boers E J W et al., editor, Real World Applications of Evolutionary Computing. Proceedings of EvoWorkshops 2001. Springer-Verlag, 2001.
Paechter B Chisholm K Urquhart N, Ross P. Improving street based routing using building block mutations. In To Appear in: Applications of Evolutionary Computing. Proceedings of EvoWorkshops 2002. Springer-Verlag, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urquhart, N., Ross, P., Paechter, B., Chisholm, K. (2002). Solving a Real World Routing Problem Using Multiple Evolutionary Agents. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_84
Download citation
DOI: https://doi.org/10.1007/3-540-45712-7_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44139-7
Online ISBN: 978-3-540-45712-1
eBook Packages: Springer Book Archive