节点文献
不确定车辆数的有时间窗车辆路径问题的遗传算法
Genetic Algorithm for Variable Fleet Vehicle Routing Problem with Time Window
【摘要】 给出了不确定车辆数的有时间窗车辆路径问题(VRPTW)的数学模型,提出一种基于客户的编码表示方式,可以表示出不同的车辆数,实现VRPTW的路径长度和车辆数的同时优化,并用计算实例进行了验证,同时对计算中涉及的一些问题进行了讨论.
【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.
【关键词】 有时间窗的车辆路径问题;
不确定车辆数;
遗传算法;
【Key words】 vehicle routing problem with time window; uncertain vehicle number; genetic algorithm;
【Key words】 vehicle routing problem with time window; uncertain vehicle number; genetic algorithm;
- 【文献出处】 系统工程理论与实践 ,Systems Engineering-theory & Practice , 编辑部邮箱 ,2004年06期
- 【分类号】O29
- 【被引频次】149
- 【下载频次】1367