摘要
在日益激烈的市场竞争中,如何在降低成本的同时,让各个顾客尽快收到货物成了现代交通运输物流中一个越来越重要的考虑因素。基于某快递公司的运输实例,本文提出了装卸一体化的车辆路径问题模型,最终优化目标是最小化车辆运输时间和货物到各个顾客的时间的加权和,并给出了一种基于插入法的新禁忌算法,实验结果表明新禁忌算法在显著提高传统禁忌算法计算时间的同时,还能得到理想的成本,并且对节约快递公司的运输成本方面有显著成效。
In today＇s distribution environment,under intensive competition,making customer receive goods as soon as possible becomes a increasingly significant consideration.Motivated from a real express company problem,this paper provides the math formulation for a vehicle routing problem with pick-up and delivery.The objective has two parts： vehicle traveling time and customers latencies.An insertion based new Tabu search algorithm is proposed to solve the problem quite efficiently.The computation results show that the new Tabu search algorithm is quite faster than the traditional one,and it could get rather good solution quality,especially for the small size problem.
出处
《中国管理科学》
CSSCI
北大核心
2010年第2期89-95,共7页
Chinese Journal of Management Science
基金
国家自然科学青年基金资助项目(70901029)
关键词
装卸一体化
车辆路径问题
禁忌算法
pick-up and delivery
vehicle routing problem
Tabu search
