|
|||||
|
|
Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads |
|
| Institution: | 1. School of Traffic and Transportation Engineering, Central South University, Changsha 410075, PR China;2. Lancaster University Management School, Lancaster, UK;3. College of Economics and Management, Hengyang Normal University, Hengyang 421008, PR China;1. Pamukkale University, Faculty of Engineering, Department of Industrial Engineering, Kinikli, 20070 Denizli, Turkey;2. Seoul National University, College of Engineering, Department of Industrial Engineering, Seoul 151-744, Republic of Korea |
| Abstract: | This paper addresses the routing problem with unpaired pickup and delivery with split loads. An interesting factor of our problem is that the quantity and place for pickup and delivery are decision variables in the network. We develop an easy-to-implement heuristic in order to gain an efficient and feasible solution quickly. Then, a local search algorithm based on the variable neighborhood search (VNS) method is developed to improve the performance of the heuristic. Computational results show that the proposed VNS method is able to obtain an optimal or near optimal solution in reasonable time for the formulated problem. |
| Keywords: | Logistics Vehicle routing Transport Pickup and delivery Variable neighborhood search |
| 本文献已被 ScienceDirect 等数据库收录！ | |