Using genetic algorithm solving shortest path problem

MaRDI QIDQ3537370zbMATH OpenFDO

Authors Jianqiang Liu, Wen Xu, Fenlin Liu, Feng Dai

Publication date 24 November 2008

zbMATH Keywords

genetic algorithmlength-variant chromosomeshortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A self-adaptive genetic algorithm for the shortest path planning of vehicles and its comparison with Dijkstra and A^* algorithms
• Finding shortest path with learning algorithms
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• A genetic algorithms to solve the bicriteria shortest path problem
• A novel genetic algorithm for solving the clustered shortest-path tree problem

Cited in

(7)

• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Finding shortest path with learning algorithms
• A novel genetic algorithm for solving the clustered shortest-path tree problem
• A self-adaptive genetic algorithm for the shortest path planning of vehicles and its comparison with Dijkstra and A^* algorithms
• Application of genetic algorithm to a parallel path selection problem
• An intelligent evolutionary computation approach for solving the shortest path problem
• A improved evolutionary algorithm for the shortest path routing problem

This page was built for publication: Using genetic algorithm solving shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537370)