Optimizing Highway Transportation Path by Chaos Genetic Algorithm
Ling‐Yi Kong · Journal of Transportation Systems Engineering and Information Technology · 2013
Highway transportation path problem has been proven to be a non-deterministic polynomial complete problem with high research value.It involves some unconnected graph constraints that make the solving process become more complex.In view of the defects of premature convergence and slow convergence of the traditional genetic algorithm,this paper makes the generation of initial population,crossover,mutation and search operation to design a chaos genetic algorithm.The algorithm adopts the chromosome encoding scheme based on sequence of city that highway vehicle passed through.It combines the stochastic method and greedy method to produce the initial populations in order to contain the optimal value,avoid infeasible chromosomes and improve the subsequently genetic efficiency.Then,precedence preservation crossover and shift change mutation operations are operated.Meanwhile,the local neighborhood search and chaos search are successively introduced to accelerate the convergence.Furthermore,the criterion is given to verify whether the optimal solution meets unconnected graph constraints or not.Finally,the computation results prove the effectiveness of the proposed method.The method can generate the optimal solution with less range of offspring population and better convergence