Intelligent optimization approach for the k shortest paths problem based on genetic algorithm

To address the k shortest paths (KSP) problem, an intelligent optimization approach based on Genetic Algorithm (GA) is presented in this paper. A simple and intuitive natural path representation is firstly employed to be the chromosome encoding scheme. Then genetic operators specific to this encoding scheme are defined respectively. Each partial route of two chosen chromosomes is exchanged by a one-point crossover operator at common intersections. A one and two-point mutation operators are adopted to perform mutation operations for directed and undirected graphs respectively. And a bidirectional searching strategy is applied to eliminate loops in the paths generated by the above genetic operators. Comparative experiments were conducted on test graphs by using different strategies of genetic operations, mutation rates and operators. And the experimental results verify the validity of the proposed algorithm.

[1]  Yinzhen Li,et al.  An oriented spanning tree based genetic algorithm for multi-criteria shortest path problems , 2012, Appl. Soft Comput..

[2]  Hai Jiang,et al.  Finding the K shortest paths in a time-schedule network with constraints on arcs , 2013, Comput. Oper. Res..

[3]  Xue Wei,et al.  Research on Computing Weight of Customer Satisfaction Based on Fuzzy AHP , 2006 .

[4]  Ahmed Younes Hamed,et al.  A genetic algorithm for finding the k shortest paths in a network , 2010 .

[5]  Cheikh Mohamed,et al.  A genetic algorithms to solve the bicriteria shortest path problem , 2010 .

[6]  Marta M. B. Pascoal,et al.  The k Shortest Paths Problem , 1998 .

[7]  Wang Fang-xiu.  Application of dijkstra algorithm in intelligent transportation system , 2010 .

[8]  Yudong Zhang,et al.  Find multi-objective paths in stochastic networks via chaotic immune PSO , 2010, Expert Syst. Appl..

[9]  Sun Yu-geng.  A Practical Loop-less K-path Algorithm Applied in Route Planning , 2003 .

[10]  Liu San-yang.  Novel Precomputation Algorithms for QoS Routing Based on the K-optimal Paths , 2005 .

[11]  Pascal Fua,et al.  Ieee Transactions on Pattern Analysis and Machine Intelligence 1 Multiple Object Tracking Using K-shortest Paths Optimization , 2022 .

[12]  Sohail S. Chaudhry,et al.  Finding the K shortest paths in a schedule-based transit network , 2012, Comput. Oper. Res..

[13]  Lu Feng.  The Kth Shortest Path Algorithms:Accuracy and Efficiency Evaluation , 2009 .

[14]  Luis C. Dias,et al.  Shortest path problems with partial information: Models and algorithms for detecting dominance , 2000, Eur. J. Oper. Res..

[15]  Pawan Lingras,et al.  Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks , 2003, Eur. J. Oper. Res..

[16]  Mehdi Ghatee,et al.  Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms , 2012 .

[17]  Ozgur Sinanoglu,et al.  An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks , 2010, IEEE Transactions on Computers.

[18]  Liu Lin.  Efficient hybrid algorithm for multi-shorter-path searching in ITS , 2011 .

[19]  Liu Qing.  A Shuffled Frog Leaping Algorithm for k-Shortest Paths Problem , 2011 .

[20]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..