计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (15): 232-235.
• 工程与应用 • 上一篇 下一篇
杨皎平1,高雷阜2,杨 韬2
收稿日期:
修回日期:
出版日期:
发布日期:
YANG Jiaoping1,GAO Leifu2,YANG Tao2
Received:
Revised:
Online:
Published:
摘要: 给出了企业间产品可转运的联盟车辆路径问题(EAVRVPPT)数学模型。提出求解该问题的遗传算法,相对于传统算法,该算法在编码方式和交叉算子方面进行了改进。为了证实模型和方法的有效性,通过计算实例进行了验证。
关键词: 多企业联盟车辆路径问题, 企业间产品转运, 遗传算法
Abstract: This paper presents a mathematical model of enterprise alliance vehicle routing problem with product can transfer each other,and its genetic algorithm is proposed,the coding method and crossover are improved.The experiment proves the effectiveness of this algorithm.
Key words: multiple enterprise alliance vehicle routing problem, product transfer each other among enterprises, genetic algorithm
杨皎平1,高雷阜2,杨 韬2. 企业间转运联盟车辆路径问题及遗传优化[J]. 计算机工程与应用, 2011, 47(15): 232-235.
YANG Jiaoping1,GAO Leifu2,YANG Tao2. Enterprise transfer alliance vehicle routing problem and its genetic algorithm[J]. Computer Engineering and Applications, 2011, 47(15): 232-235.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2011/V47/I15/232