Improving street based routing using building block mutations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2279 LNCS, Issue , 2002, Pages 334-341

  Urquhart, Neil ^a   Ross, Peter ^a   Paechter, Ben ^a   Chisholm, Kenneth ^a  

^a EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; SIGNAL PROCESSING;

BUILDING BLOCKES; HEURISTIC MUTATION; REAL-WORLD; ROUTING PROBLEMS; TEST DATA; URBAN AREAS;

EVOLUTIONARY ALGORITHMS;

EID: 84878631705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46004-7_33     Document Type: Conference Paper

References (16)

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.
2. Urquhart N, Paechter B, Chisholm K. Street-based Routing Using an Evolutionary Algorithm. Proceedings of EvoWorkshops 2001, Como, Italy Eds, E.J.W. Boers et al. Springer-Verlag 2001.
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.
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.
5. Balaji R and Jeyakesavan V A 3/2-Approximation Algorithm for the Mixed Postman Problem. SIAM Journal on Discrete Mathematics Vol 12 No 4, 1999
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.
7. Gero, J S and Krazakov, V. Evolving design genes in space layout problems. Artificial Intelligence in Engineering 12(3) pp 193-176.
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 1997
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.
10. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs (Third, Revised and Extended Edition). Springer-Verlag 1996.
11. Wu A S, Lindsay R K. A comparison of the fixed and floating building block representation in the genetic algorithm. Evolutionary Computation Vol. 4, No 2 pp 169-193. MIT Press 1996. (Pubitemid 126706155)
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.
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.
14. Bui T, Moon B. A new Genetic Approach for the Traveling Salesman Problem. Proceedings of the First IEEE Conference on Evolutionary Computation 1994.
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.
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.