The Research On The Shortest Path Algorithm With Multi-constrained Condition

Path planning for city traffic network is more important because the abominable city traffic environment.The problem of the shortest path is one of the core of path planning.This paper studies the multi-constrained conditions of city traffic, and divided the constraints into two categories: directly on the road,or between two adjacent road sections.For the shortcomings of node path representation,this paper used the arc path representation.And the multi-constrained shortest path problem definition is given.This paper selected genetic algorithm to solve the problem,and proposes the specific method to realize the choosing, crossing and mutation of genetic algorithm.The content which this paper studies is suitable for the current city traffic environment,and have some practical value.