Abstract
Street based routing (SBR) is a real-world inspired routing problem that builds routes within an urban area for mail deliveries. The authors have previously attempted to solve this problem using an Evolutionary Algorithm (EA). In this paper the authors examine a heuristic mutation based on concept of building blocks. In this case a building block is defined as a group of genes, which when placed together within a genotype result in a useful feature within the phenotype. After evaluation on three test data sets our experiments conclude that the explicit use of heuristic building blocks makes a significant improvement to the SBR algorithms results.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Bousonville, T. Local Search and Evolutionary Computation for Arc Routing in Garbage Collection. Proceedings of the Genetic and Evolutionary Computation Conference 2001. Eds L Spector, E Goodman, A Wu, W B Langdon, H M Voigt, M Gen, S Sen, M Dorigo, S Pezeshk, M Garzon E Burke. Morgan Kaufman Publishers 2001.
Urquhart N, Paechter B, Chisholm K. Street-based Routing Using an Evolutionary Algorithm. Proceedings of EvoWorkshops 2001, Como, Italy Eds, E.J.W. Boerset al. Springer-Verlag 2001.
Lacomme P, Prins C, Ramdane-Cherif W. A Genetic Algorithm for the capacitated Arc routing problem and its extensions. Proceedings of EvoWorkshops 2001, Como, Italy Eds, E.J.W. Boers et al. Springer-Verlag 2001.
Hart E, Ross P, Nelson J. Scheduling Chicken Catching-An Investigation Into The Success Of A Genetic Algorithm On A Real World Scheduling Problem. Annals Of Operations Research 92 Baltzer Science Publishers 1999.
Balaji R and Jeyakesavan V A 3/2-Approximation Algorithm for the Mixed Postman Problem. SIAM Journal on Discrete Mathematics Vol 12No 4, 1999
Kang, M and Han, C. Solving the rural postman problem using a genetic algorithm with a graph transformation. Proceedings of the 1998 ACM symposium on Applied Computing. ACM Press New York 1998.
Gero, J S and Krazakov, V. Evolving design genes in space layout problems. Artificial Intelligence in Engineering 12(3) pp 193–176.
Gero, J. S., Kazakov, V. and Schnier, T. Genetic engineering and design problems. in D. Dasgupta and Z. Michalewicz (eds), Evolutionary Algorithms in Engineering Applications, pp. 47–68. Springer-Verlag, Berlin 1997
Freisleben B. and Merz P. New Genetic Local Search Operators for the Traveling Salesman Problem. Parallel Problem Solving from Nature-PPSN IV Eds: Hans-Michael Voigt, Werner Ebeling Ingo Rechenberg, Hans-Paul Schwefel Springer-Verlag 1996..
Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs (Third, Revised and Extended Edition). Springer-Verlag 1996.
Wu A S, Lindsay R K. A comparison of the fixed and floating building block representation in the genetic algorithm. Evolutionary Computation Vol4, No 2pp 169–193. MIT Press 1996.
Rosca J. Towards automatic discovery of building blocks in genetic programming. Working notes for the AAAI Symposium on Genetic Programming pp 78–85. 1995.
Tamaki H, Kita H, Shimizu N, Maekawa K, Nishikawa Y. A Comparison Study of Genetic Codings for the Travelling Salesman Problem. Proceedings of the First IEEE Conference on Evolutionary Computionary Computation 1994.
Bui T, Moon B. A new Genetic Approach for the Traveling Salesman Problem. Proceedings of the First IEEE Conference on Evolutionary Computation 1994.
Thangiah S, Vinayagamoorthy R, Gubbi A. Vehicle Routing with Time Deadlines using Genetic and Local Algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms Forrest S Ed. Morgan Kaufmann 1993.
Blanton, J.L. Jr. and Wainwright, R.L. Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms Forrest S Ed. Morgan Kaufmann, 1993.
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). Improving Street Based Routing Using Building Block Mutations. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds) Applications of Evolutionary Computing. EvoWorkshops 2002. Lecture Notes in Computer Science, vol 2279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46004-7_33
Download citation
DOI: https://doi.org/10.1007/3-540-46004-7_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43432-0
Online ISBN: 978-3-540-46004-6
eBook Packages: Springer Book Archive