摘要
为了寻求汽车零部件采用循环取货时车辆的最优路径,提出将每个供应商零部件循环、分批提取使车辆尽可能满载的建模思路,建立具有车辆容积、车辆到达时间窗、供应商供货动态时间窗、车辆最大行程约束的车辆调度优化模型,设计了用于求解该模型的改进启发式节约算法。最后通过算例验证了多重约束模型及算法的有效性。
To seek the optimal path for the vehicles to take delivery of auto parts under the Milk-run,a modeling idea that each components supplier＇s spare parts were delivered by the way of circular and batch delivery to make as full use of the vehicle as possible was put forward.The optimizing model of vehicle routing problem was established with the constraints of vehicle cubage,arriving time window,supplier supplying dynamic time window and maximum running distance.After that,a heuristic saving algorithm（or C-W algorithm） was designed to provide a solution to the model.Finally,one example was given to prove the validity of the model and algorithm.
出处
《计算机应用》
CSCD
北大核心
2011年第4期1125-1128,1132,共5页
journal of Computer Applications
基金
国家863计划项目(2006AA04A123)
教育部人文社科青年基金资助项目(09YJC630246)
关键词
循环取货
动态时间窗
满载提取
启发式节约算法
Milk-run
dynamic time window
full-taking delivery
heuristic Clark-Wright（C-W） algorithm
