Skip to main content
Springer Nature Link
Log in

Genetic Algorithms for Solving Shortest Path Problem in Maze-Type Network with Precedence Constraints

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Shortest path (SP) problem is a classical combinatorial optimization problem, which has various application domains such as communication network routing and location-based services under cloud environment. However, maze-type networks, sparse networks with many pairs of disconnected nodes, had rarely been studied. A maze-type network is more difficult to analyze than common dense network, since it has rare feasible paths. Moreover, precedence constraints among the nodes further increase the complexity of maze-type network, and this paper aims to develop genetic algorithms for finding the shortest path in maze-type network with precedence constraints. In order to address precedence constrained maze-type shortest path (PCM-SP) problem, the fitness switching genetic algorithm (FSWGA), which has been developed to solve the unconstrained maze-type shortest path (M-SP) problems, is revised by adopting position listing representation as encoding scheme and applying two enhanced decoding procedures. In addition, genetic operator of candidate order based genetic algorithm (COGA) is used to explore the search space effectively, and experiment results demonstrate that the enhanced FSWGA can solve PCM-SP problems more effectively than the previous FSWGA.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks, 44(3), 216–229.

    Article  MathSciNet  MATH  Google Scholar 

  2. Senthil Kumar, K., & Ramkumar, D. (2016). Combined genetic and fuzzy approach for shortest path routing problem in ad hoc networks. Wireless Personal Communications, 90(2), 609–623.

    Article  Google Scholar 

  3. Kim, J. W., & Kim, S. K. (2016). Fitness switching genetic algorithm for solving combinatorial optimization problems with rare feasible solutions. Journal of Supercomputing, 72(9), 3549–3571.

    Article  Google Scholar 

  4. Zhang, L., Li, J., Yang, S., & Wang, B. (2017). Privacy preserving in cloud environment for obstructed shortest path query. Wireless Personal Communications, 96(2), 2305–2322.

    Article  Google Scholar 

  5. Ahuja, R. K., Mehlhorn, K., Orlin, J., & Tarjan, R. E. (1990). Faster algorithms for the shortest path problem. Journal of the ACM, 37(2), 213–223.

    Article  MathSciNet  MATH  Google Scholar 

  6. Lenstra, J. K., & Kan, A. R. (1978). Complexity of scheduling under precedence constraints. Operations Research, 26(1), 22–35.

    Article  MathSciNet  MATH  Google Scholar 

  7. Kowalczyk, R. (1997). Constraint consistent genetic algorithms. In Proceedings of the 1997 IEEE international conference on evolutionary computation (pp. 343–348).

  8. Moon, C., Kim, J., Choi, G., & Seo, Y. (2002). An efficient genetic algorithm for the traveling salesman problem with precedence constraints. European Journal of Operational Research, 140(3), 606–617.

    Article  MathSciNet  MATH  Google Scholar 

  9. Kim, J. W. (2016). Candidate order based genetic algorithm (COGA) for constrained sequencing problems. International Journal of Industrial Engineering: Theory Applications and Practice, 23(1), 1–12.

    Google Scholar 

  10. Poon, P. W., & Carter, J. N. (1995). Genetic algorithm crossover operators for ordering applications. Computers & Operations Research, 22(1), 135–147.

    Article  MATH  Google Scholar 

  11. Tseng, H.-W., Lee, Y.-H., Lo, C.-Y., Yen, L.-Y., & Jan, Y.-G. (2015). Applying genetic algorithms to the data traffic scheduling and performance analysis of a long-term evolution system. Wireless Personal Communications, 81(1), 387–403.

    Article  Google Scholar 

  12. Zadehparizi, F., & Jam, S. (2017). Frequency reconfigurable antennas design for cognitive radio applications with different number of sub-bands based on genetic algorithm. Wireless Personal Communications. https://doi.org/10.1007/s11277-017-5022-5.

    Google Scholar 

  13. Su, S., & Tsuchiya, K. (1993). Learning of a maze using a genetic algorithm. In Proceedings of the 1993 international conference on industrial electronics, control, and instrumentation (pp. 376–379).

  14. Baba, N., & Hanada, H. (1994). Genetic algorithm applied to maze passing problem of mobile robot—a comparison with the learning performance of the hierarchical structure stochastic automata. In Proceedings of the 1994 IEEE international conference on neural networks (pp. 2690–2695).

  15. Inagaki, J., Haseyama, M., & Kitajima, H. (1999). A genetic algorithm for determining multiple routes and its applications. In Proceedings of the 1999 IEEE international symposium on circuits and systems (pp. 137–140).

  16. Gordon, V. S., & Matley, Z. (2004). Evolving sparse direction maps for maze pathfinding. In Proceedings of the 2004 congress on evolutionary computation (pp. 835–838).

  17. Li, S., Ding, M., Cai, C., & Jiang, L. (2010). Efficient path planning method based on genetic algorithm combining path network. In Proceedings of the 2010 4th international conference on genetic and evolutionary computing (pp. 194–197).

  18. Carrick, C., & MacLeod, K. (2013). An evaluation of genetic algorithm solutions in optimization and machine learning. In Proceedings of the 21st annual conference of Canadian association for information science (pp. 224–231).

  19. Goldberg, D. E., & Lingle, R. (1985). Alleles, loci, and the traveling salesman problem. Proceedings of the international conference on genetic algorithms and their applications, 154, 154–159.

    MATH  Google Scholar 

  20. Oliver, I. M., Smith, D. J., & Holland, J. R. (1987). A study of permutation crossover operators on the traveling salesman problem. In Proceedings of the 2nd international conference on genetic algorithms (pp. 224–230).

  21. Davis, L. (1985). Applying adaptive algorithms to epistatic domains. Proceedings of the international joint conference on artificial intelligence, 85, 162–164.

    Google Scholar 

  22. Syswerda, G. (1991). Schedule optimization using genetic algorithms. In L. Davis (Ed.), Handbook of genetic algorithms (pp. 332–349). New York: Van Nostrand Reinhold.

    Google Scholar 

  23. Lee, K. M., Yamakawa, T., & Lee, K. M. (1998). A genetic algorithm for general machine scheduling problem. Proceedings of international conference on knowledge based intelligent electronics systems, 2, 60–66.

    Google Scholar 

  24. Whitley, D., Hains, D., & Howe, A. (2009). Tunneling between optima: partition crossover for the traveling salesman problem. In Proceedings of the 11th annual conference on genetic and evolutionary computation (pp. 915–922).

  25. Kozen, D. (1992). The design and analysis of algorithms. New York: Springer.

    Book  MATH  Google Scholar 

  26. Kim, J. W. (2015). Developing a job shop scheduling system through integration of graphic user interface and genetic algorithm. Multimedia Tools and Applications, 74(10), 3329–3343.

    Article  Google Scholar 

Download references

Acknowledgement

This research was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korea government (Ministry of Science, ICT & Future Planning) (NRF-2017R1C1B1008650).

Author information

Authors and Affiliations

  1. Department of Industrial and Management Systems Engineering, Dong-A University, Nakdongdaero 550beon-gil, Saha-gu, Busan, Korea

    JunWoo Kim

  2. Department of Game Engineering, Paichai University, Baejae-ro 155-40, Seo-Gu, Daejeon, Korea

    Soo Kyun Kim

Authors
  1. JunWoo Kim
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Soo Kyun Kim
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Soo Kyun Kim.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, J., Kim, S.K. Genetic Algorithms for Solving Shortest Path Problem in Maze-Type Network with Precedence Constraints. Wireless Pers Commun 105, 427–442 (2019). https://doi.org/10.1007/s11277-018-5740-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-018-5740-3

Keywords