| Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets |
| |
| 作者姓名： | 李妍峰 李军 赵达 |
| |
| 作者单位： | School of Economics and Management Southwest Jiaotong University，Caotang School Sichuan Normal University Chengdu 610072 China，School of Economics and Management Southwest Jiaotong University，School of Economics and Management Southwest Jiaotong University，Chengdu 610031 China，Chengdu 610031 China，Chengdu 610031 China |
| |
| 基金项目： | The National Natural Science Founda-tion of China ( No.70471039)，the National Social Science Foundation of China (No.07BJY038)，the Program for New Century Excellent Talents in University (No.NCET-04-0886) |
| |
| 摘 要： | Introduction Vehicle routing problem (VRP) with differentfleets is an important investment decision in reality. Itconsists of two decision-making processes: selectingvehicles of available types and routing the selectedfleet. A desirable fleet has more than one type of ve-hicles. Typically, the fixed cost of vehicles accountsfor approximately 80% of the total cost associatedwith vehicles1]. The fixed cost is a major factor todetermine vehicle combination in a fleet.A few models were develope…
|
| 关 键 词： | 交通线路问题 储蓄方法 程序设计 循环周期 |
| 文章编号： | 1005-2429（2007）04-0344-09 |
| 修稿时间： | 2006-11-12 |
Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets |
| |
| LI Yan-feng,Li Jun,ZHAO Da.Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets[J].Journal of Southwest Jiaotong University,2007,15(4):344-352. |
| |
| Authors: | LI Yan-feng Li Jun ZHAO Da |
| |
| Institution: | 1. School of Economics and Management,Southwest Jiaotong University,Chengdu,610031,China;Caotang School,Sichuan Normal University,Chengdu,610072,China
2. School of Economics and Management,Southwest Jiaotong University,Chengdu,610031,China |
| |
| Abstract: | To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts two-phase strategy. In the first phase, the improved savings method is used to assign customers to appropriate vehicles. In the second phase, the iterated dynasearch algorithm is adopted to route each selected vehicle with the assigned customers. The iterated dynasearch algorithm combines dynasearch algorithm with iterated local search algorithm based on random kicks. The second methodplogy adopts the idea of cyclic transfer which is performed by using dynamic programming algorithm, and the iterated dynasearch algorithm is also embedded in it. The test results show that both methodologies generate better solutions than the traditional method, and the second methodology is superior to the first one. |
| |
| Keywords: | Vehicle routing problem Savings method Iterated dynasearch algorithm Dynamic programming Iterated local search Random kick Cyclic transfer |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
