Advertisement

Improving Street Based Routing Using Building Block Mutations

  • Neil Urquhart
  • Peter Ross
  • Ben Paechter
  • Kenneth Chisholm
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2279)

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

Building Block Travel Salesman Problem Travel Salesman Problem Street Section Delivery Point 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Balaji R and Jeyakesavan V A 3/2-Approximation Algorithm for the Mixed Postman Problem. SIAM Journal on Discrete Mathematics Vol 12No 4, 1999 Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    Gero, J S and Krazakov, V. Evolving design genes in space layout problems. Artificial Intelligence in Engineering 12(3) pp 193–176.Google Scholar
  8. 8.
    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 1997Google Scholar
  9. 9.
    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..Google Scholar
  10. 10.
    Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs (Third, Revised and Extended Edition). Springer-Verlag 1996.Google Scholar
  11. 11.
    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.CrossRefGoogle Scholar
  12. 12.
    Rosca J. Towards automatic discovery of building blocks in genetic programming. Working notes for the AAAI Symposium on Genetic Programming pp 78–85. 1995.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    Bui T, Moon B. A new Genetic Approach for the Traveling Salesman Problem. Proceedings of the First IEEE Conference on Evolutionary Computation 1994.Google Scholar
  15. 15.
    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.Google Scholar
  16. 16.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Neil Urquhart
    • 1
  • Peter Ross
    • 1
  • Ben Paechter
    • 1
  • Kenneth Chisholm
    • 1
  1. 1.School Of ComputingNapier UniversityEdinburghScotland

Personalised recommendations