摘要
应用遗传算法（GA）来解决起终点固定的货物配送问题（可抽象为起终点固定的TSP问题,以下简写为ST-TSP）.针对问题的特性设计了编码方式和适应度函数,并借鉴GA研究TSP问题的方法设计了选择、交叉和变异算子,实验结果数据显示该方法具有良好的搜索性能和鲁棒性.此外,论文还开发了基于Visual C++语言和MapX控件的实用物流货物配送软件平台.
In this paper, genetic algorithms (GA) is applied to solve the special TSP problem which has fixed start and terminal points. The encoding scheme, fitness function, selection, crossover and mutation operator of GA are designated deliberately with respect to the specialty of problem. The experimental results show the algorithm possesses good searching property. In addition, a practical logistics goods distribution software is developed based on the Visual C+ + and MapX.
出处
《交通运输系统工程与信息》
EI
CSCD
2002年第2期19-23,共5页
Journal of Transportation Systems Engineering and Information Technology
基金
北方交通大学校基金资助(2001XM19)
