Genetic Algorithm Solves the Optimal Path Problem

  • Liu Wan-jun
  • Wang Hua
  • Wang Ying-bo
Conference paper
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 116)

Abstract

In view of the solution of optimal path in network transport, the paper uses the basic principle of genetic algorithm to carry on the choice, overlapping and the variation. After the operation of the variation, the new individual variation should be recalculated to determine the fitness of individual choice in order to enhance the astringency of the algorithm. And through a mathematical model simulation experiment, it has some theoretical and practical value.

Keywords

Optimal path Algorithm Modeling Simulation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wang, X.-P., Cao, L.-M.: GA-Theory, Applications and Software realize. Xi’an Jiaotong University Publishing House (January 2002)Google Scholar
  2. 2.
    Zou, T., Li, N., Sun, D.-B., Li, J.: Genetic Algorithm for Multiple-Depot Vehicle Routing Problem. Computer Engineering and Applications (2004)Google Scholar
  3. 3.
    Ma, X.: A Genetic Algorithm for k Optimal Paths Problem. Computer Engineering and Applications 12 (2006)Google Scholar
  4. 4.
    Jiang, D.-L., Yang, X.-L., Du, W., Zhou, X.-W.: A Study on the Genetic Algorithm for Vehicle Routing Problem. Systems Engineering-Theory&Practice (1999)Google Scholar
  5. 5.
    Liang, K., Xia, D.-C.: Genetic Algorithm Programming By Matlab And Optimizing Problem Solving. Development and Design Technology (December 2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Liu Wan-jun
    • 1
  • Wang Hua
    • 2
  • Wang Ying-bo
    • 1
  1. 1.College of Software EngineeringLiaoning Technical UniversityHu LudaoChina
  2. 2.The School of Electronics and Information EngineeringLiaoning Technical UniversityHu LudaoChina

Personalised recommendations