求解多目标运输问题的实现技术

Implementation Technology of Solving Multi-objective Transportation Problem

运输问题有特殊的数据结构———运输树。本文应用基于支撑树的遗传算法求解多目标运输问题,介绍了能表示运输问题所有基解的节点编码方法及对节点编码的交配与变异规则,给出了染色体转换成运输树的可行性准则。

The transportation problem has a special data structure, namely a transportation tree. This paper presents spanning treebased genetic algorithm for solving multiobjective transportation problem. It introduces one of node encoding based on a spanning tree which can demonstrates all possible basic solutions. The crossover and mutation are designed on the basis of this encoding in the paper. Also it poses the feasible criterion on which chromosome can be converted to a transportation tree.Key words: multiobjective optimization; transportation problem; spanning tree; Genetic Algorithm