| 求解配送\收集旅行商问题的启发式算法 |
| |
| 引用本文： | 霍佳震,张磊.求解配送\收集旅行商问题的启发式算法[J].同济大学学报(自然科学版),2006,34(1):134-138. |
| |
| 作者姓名： | 霍佳震 张磊 |
| |
| 作者单位： | 同济大学,经济与管理学院,上海,200092 |
| |
| 基金项目： | 上海市科委资助项目;上海市科委资助项目 |
| |
| 摘 要： | 配送＼收集旅行商问题大多假定必须在完成所有的配送需求后，才服务收集需求．放松这一约束条件，通过对模型的分析、分解和过滤，结合实际情况，以修正的Clarke-Wright节约启发式算法和最邻近算法为基础进行插入式排序，以解决这类问题，并应用算例进行分析说明．
|
| 关 键 词： | 第三方物流 节约/插入算法 车辆路径规划 配送\收集旅行商问题 |
| 文章编号： | 0253-374X（2006）01-0134-05 |
| 收稿时间： | 09 22 2004 12:00AM |
| 修稿时间： | 2004-09-22 |
Heuristic Algorithm for Solving Traveling Salesman Problem with Pickup And Delivery |
| |
| HUO Jiazhen,ZHANG Lei.Heuristic Algorithm for Solving Traveling Salesman Problem with Pickup And Delivery[J].Journal of Tongji University(Natural Science),2006,34(1):134-138. |
| |
| Authors: | HUO Jiazhen ZHANG Lei |
| |
| Institution: | School of Economics and Management, Tongji University, Shanghai 200092, China |
| |
| Abstract: | 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. |
| |
| Keywords: | third party logistics saving/inserting algorithm vehicle route planning(VRP) traveling salesman problem with pickup and delivery(TSPD) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
