Spanning tree-based genetic algorithm for solving bicriteria transportation problem

摘要

In this paper, we present a new approach which uses spanning tree-based genetic algorithm for solving bicriteria transportation problem. The transportation problem has the special data structure in solution characterized as a transportation graph. In encoding transportation problem, we absorb the concept on spanning tree and adopt the Prufer number as it is capable of representing all possible basic solutions. The crossover and mutation were designed based on this encoding. And we designed the criterion by which chromosomes can be always feasibly converted to a transportation tree. In the evolutionary process, the mixed strategy with (μ + λ) -selection and roulette wheel selection is used. To confirm the performance of the proposed algorithm based on spanning tree representation, we firstly show the effectiveness of the algorithm by the single objective problems. And then the efficiency of the proposed algorithm will shown.