Spanning tree-based genetic algorithm for bicriteria transportation problem

In this paper, we present a new approach which is spanning tree-based genetic algorithm for bicriteria transportation problem. The transportation problem has special data structure in solution characterized as a spanning tree. In encoding transportation problem, we introduce one of node encoding: which is adopted as it is capable of equally and uniquely representing all possible basic solutions. The crossover and mutation was designed based on this encoding. And we designed the criterion that chromosome always feasibility converted to a transportation tree. In the evolutionary process, the mixed strategy and roulette wheel selection is used. Numerical experiments show the effectiveness and efficiency of the proposed algorithm.