摘要
配送\收集旅行商问题大多假定必须在完成所有的配送需求后,才服务收集需求.放松这一约束条件,通过对模型的分析、分解和过滤,结合实际情况,以修正的Clarke-Wright节约启发式算法和最邻近算法为基础进行插入式排序,以解决这类问题,并应用算例进行分析说明.
An assumption is usually introduced into traveling salesman problem with pickup and delivery （TSPD） that all the delivery demands must be satisfied before pickup. Based on the analysis and decomposition of the model, a modified clarke-wright, a kind of saving/inserting algorithm without taking the above assumption into consideration is adopted to solve the problem. Also a case example is conducted in this paper.
出处
《同济大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2006年第1期134-138,共5页
Journal of Tongji University:Natural Science
基金
上海市科委重大资助项目(03DZ15006)
上海市科委重点资助项目(03JC14068)
关键词
第三方物流
节约/插入算法
车辆路径规划
配送\收集旅行商问题
third party logistics
saving/inserting algorithm
vehicle route planning（VRP）
traveling salesman problem with pickup and delivery（TSPD）
