Abstract
The authors have previously introduced the concept of building a delivery network using an agent-based system. The delivery networks are built in response to a real-world problem that involves delivering post to a large number of households within an urban area. The initial agent based system worked to primarily resolve hard constraint violations. To further improve the solution obtained by the agents, we propose to allow agents to negotiate exchanges of work. We demonstrate the solution obtained may be further improved by allowing such negotiated transactions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Bierwirth, D. C. Mattfeld, and H. Kopfer. On permutation representations for scheduling problems. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature-PPSN IV, pages 310–318, Berlin, 1996. Springer.
T. Bousonville. Local search and evolutionary computation for arc routing in garbage collection. In L. Spector, editor, Proceedings of the Genetic and Evolutionary Computation Conference 2001. Morgan Kaufman Publishers, 2001.
Dan Bonachea, Eugene Ingerman, Joshua Levy and S. McPeak. An improved adaptive multi-start approach to finding near-optimal solutions to the euclidean TSP. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 143–150, Las Vegas, Nevada, USA, 10-12 2000. Morgan Kaufmann.
B. Freisleben and P. Merz. New genetic local search operators for the travelling salesman problem. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Proceedings of the Fourth Conference on Parallel Problem Solving from Nature(PPSN IV), volume 1141, pages 890–899, Berlin, 1996. Springer.
F. Glover. Tabu search-part i. ORSA Journal of Computing, 1(3):190–206, 1989.
F. Glover. Tabu search-part ii. ORSA Journal of Computing, 2:4–32, 1990.
S. R. Thangiah, J.-Y. Potvin, and T. Sun. Heuristic approaches to vehicle routing with backhauls and time windows. International Journal of Computers and Operations Research, 23(11):1043–1057, 1996.
N. Urquhart, B. Paechter, and K. Chisholm. Street based routing using an evolutionary algorithm. In E. J. W. Boers, editor, Real World Applications of Evolutionary Computing, pages 495–504. Springer-Verlag, 2001.
N. Urquhart, P. Ross, B. Paechter, and K. Chisholm. Improving street based routing using building block mutations. In Applications of Evolutionary Computing, proceedings of EvoWorkshops 2002. Springer-Verlag, 2002.
N. Urquhart, P. Ross, B. Paechter, and K. Chisholm. Solving a real world routing problem using multiple evolutionary algorithms. In Proceedings of Parallel Problem Solving from Nature (PPSN) VII, pages 871–882. Springer-Verlag, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urquhart, N.B., Ross, P., Paechter, B., Chisholm, K. (2003). Routing Using Evolutionary Agents and Proactive Transactions. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_63
Download citation
DOI: https://doi.org/10.1007/3-540-36605-9_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00976-4
Online ISBN: 978-3-540-36605-8
eBook Packages: Springer Book Archive