Spanning tree-based genetic algorithm for bicriteria transportation problem

✍ Scribed by Mitsuo Gen; Yin-Zhen Li

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 371 KB
• Volume: 35
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/s0360-8352(98)00151-x

✦ Synopsis

In this paper, we present a new approach which is spanning tree-based genetic algorithm for bicriteria transport,ation problem. The transportation problem have the 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 selecction is used. Numerical experiments will be shown the effect,iveness and efficiency of the proposed algorithm.