一种带有时间窗的货物配送路线设计算法  

An Algorithm for Designing the Route of Freight Delivery with Time Windows

作　　者：杨容浩[1] 范俊波[1] 杨佳[2] 邓虎成[1] 

机构地区：[1]西南交通大学计算机通信工程学院,成都610031 [2]西南交通大学电气工程学院,成都610031

出　　处：《交通运输工程与信息学报》2005年第1期30-35,共6页Journal of Transportation Engineering and Information

摘　　要：提供了一种有大量的客户数据,只需对部分客户进行带有时间窗要求的货物配送的优化路径选择算法。该算法首先通过寻找的隐含条件利用可行的算法将问题规模进行缩小,然后利用特殊情况获取限制条件,不断缩小搜索范围,从而搜索到有效解。该算法针对具体问题设计,适合应用于工程实践。A kind of algorithm is provided to choose the optimized route for freight delivery that involves a great deal of clients’ data, but, only deals with a part of them with the request of time windows. Firstly, it reduces the size of problem with a feasible method by searching implicit factors. After that, it obtains restrictive conditions by using the especial instance and reduces the searching range continually, then finds an effective solution. This algorithm aims at a specific problem, and it is also suitable to be used in other projects.

关 键 词：货郎担问题 TSP 货物配送 DIJKSTRA算法 时间窗 路线设计 

分 类 号：U492.3[交通运输工程—交通运输规划与管理]