Skip to main content

Node-Depth Encoding for Evolutionary Algorithms Applied to Multi-vehicle Routing Problem

  • Conference paper
Innovations in Applied Artificial Intelligence (IEA/AIE 2005)

Abstract

The Multi-Vehicle routing problem (MVRP) in real time is a graph modification problem. In order to solve this kind of problems, alternative approaches have been investigated. Evolutionary Algorithms (EAs) have presented relevant results. However, these methodologies require special encoding to achieve proper performance when large graphs are considered. We propose a representation based on NDE [Delbem et al., (2004a); Delbem et al., (2004b)] for directed graphs. An EA using the proposed encoding was developed and evaluated for the MVRP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Brayasy, O.: Genetic Algorithms for the Vehicle Routing Problem with Time Windows. In: Arpakannus 1/2001: Special Issue on Bioinformatics and Genetic Algorithms, University of Vaasa, Finland (2001)

    Google Scholar 

  2. Delbem, A.C.B., Carvalho, A., Policastro, C.A., Pinto, A.K.O., Honda, K., Garcia, A.C.: Node-depth Encoding Applied to the Network Design. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 678–687. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Delbem, A.C.B., Carvalho, A., Policastro, C.A., Pinto, A.K.O., Honda, K., Garcia, A.C.: Node-depth Encoding Applied to the Degree-Constrained Minimum Spanning Tree. In: Proceedings of 1st Brazilian Workshop on Evolutionary Computation, Maranhao, Brasil (2004)

    Google Scholar 

  4. Liu, Q., Lau, H.C., Seah, D., Chong, S.: An Efficient Near-Exact Algorithm for Large-Scale Vehicle Routing with Time Windows. In: Proceedings of the 5th World Congress on ITS, Korea (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Libralao, G.L., Pereira, F.C., Lima, T.W., Delbem, A.C.B. (2005). Node-Depth Encoding for Evolutionary Algorithms Applied to Multi-vehicle Routing Problem. In: Ali, M., Esposito, F. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2005. Lecture Notes in Computer Science(), vol 3533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11504894_77

Download citation

  • DOI: https://doi.org/10.1007/11504894_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26551-1

  • Online ISBN: 978-3-540-31893-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics