首页 | 本学科首页   官方微博 | 高级检索  
     

不确定车辆数的有时间窗车辆路径问题的遗传算法
引用本文:邹彤,李宁,孙德宝. 不确定车辆数的有时间窗车辆路径问题的遗传算法[J]. 系统工程理论与实践, 2004, 24(6): 134-138. DOI: 10.12011/1000-6788(2004)6-134
作者姓名:邹彤  李宁  孙德宝
作者单位:华中科技大学控制科学与工程系
摘    要:给出了不确定车辆数的有时间窗车辆路径问题(VRPTW)的数学模型,提出一种基于客户的编码表示方式,可以表示出不同的车辆数,实现VRPTW的路径长度和车辆数的同时优化,并用计算实例进行了验证,同时对计算中涉及的一些问题进行了讨论.

关 键 词:有时间窗的车辆路径问题  不确定车辆数  遗传算法   
文章编号:1000-6788(2004)06-0134-05
修稿时间:2003-07-03

Genetic Algorithm for Variable Fleet Vehicle Routing Problem with Time Window
ZOU Tong,LI Ning,SUN De-bao. Genetic Algorithm for Variable Fleet Vehicle Routing Problem with Time Window[J]. Systems Engineering —Theory & Practice, 2004, 24(6): 134-138. DOI: 10.12011/1000-6788(2004)6-134
Authors:ZOU Tong  LI Ning  SUN De-bao
Affiliation:Department of Control Science and Engineering,Huazhong University of Science and Technology
Abstract:Because the fixed cost of a vehicle is much more than the running cost, it is effective to cut down the total cost to seek the minimum number of vehicles in Vehicle Routing Problem with Time Window (VRPTW). This paper presents a mathematical model of variable fleet VRPTW. A new chromosome code that can express various vehicle number in Genetic Algorithm (GA) is developed from the code based on customers. The GA can search for optimal solution on both route length and vehicle number, which is proved by an experiment, and several points in the optimal process are discussed.
Keywords:vehicle routing problem with time window  uncertain vehicle number  genetic algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《系统工程理论与实践》浏览原始摘要信息
点击此处可从《系统工程理论与实践》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号