Heuristic algorithm to solve vehicle routing problem with split pickups and deliveries

被引:0
|
作者
Yang, Ya-Zao [1 ]
Jin, Wen-Zhou [2 ]
Hao, Xiao-Ni [2 ]
Tian, Sheng [2 ]
机构
[1] School of Business Administration, South China University of Technology, Guangzhou 510640, Guangdong, China
[2] School of Civil Engineering and Transportation, South China University of Technology, Guangzhou 510640, Guangdong, China
关键词
Pickups - Routing algorithms - Problem solving - Vehicle routing - Vehicles;
D O I
10.3969/j.issn.1000-565X.2010.03.011
中图分类号
学科分类号
摘要
In order to save the transportation cost and improve the efficiency of logistics services, the vehicle routing problem with split pickups and deliveries is investigated. According to the characteristics of this problem, that is, multiple visits for a certain task point or for the same task point by a certain vehicle are allowed, a three-phase heuristic algorithm, which splits the demands of pickups and deliveries at some task points and minimizes the total driving distance of vehicles, is proposed. Numerical results show that the proposed algorithm helps to obtain reaso-nable vehicle routings, especially with the case of total delivery amount being greater than total pickup amount.
引用
收藏
页码:58 / 63
相关论文
共 50 条
  • [1] A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
    Wang, Yong
    Ma, Xiao-lei
    Lao, Yun-teng
    Yu, Hai-yan
    Liu, Yong
    [J]. JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS, 2014, 15 (03): : 200 - 210
  • [2] A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
    Yong WANG
    Xiao-lei MA
    Yun-teng LAO
    Hai-yan YU
    Yong LIU
    [J]. Frontiers of Information Technology & Electronic Engineering, 2014, (03) : 200 - 210
  • [3] A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
    Yong Wang
    Xiao-lei Ma
    Yun-teng Lao
    Hai-yan Yu
    Yong Liu
    [J]. Journal of Zhejiang University SCIENCE C, 2014, 15 : 200 - 210
  • [4] A two-stage heuristic method for vehicle routing problem with split deliveries and pickups
    Yong WANG
    Xiaolei MA
    Yunteng LAO
    Haiyan YU
    Yong LIU
    [J]. JournalofZhejiangUniversity-ScienceC(Computers&Electronics), 2014, 15 (03) - 210
  • [5] A Tabu Search algorithm for the vehicle routing problem with discrete split deliveries and pickups
    Qiu, Meng
    Fu, Zhuo
    Eglese, Richard
    Tang, Qiong
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 100 : 102 - 116
  • [6] A heuristic method for the vehicle routing problem with mixed deliveries and pickups
    Niaz A. Wassan
    Gábor Nagy
    Samad Ahmadi
    [J]. Journal of Scheduling, 2008, 11 : 149 - 161
  • [7] A heuristic method for the vehicle routing problem with mixed deliveries and pickups
    Wassan, Niaz A.
    Nagy, Gabor
    Ahmadi, Samad
    [J]. JOURNAL OF SCHEDULING, 2008, 11 (02) : 149 - 161
  • [8] A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
    Mitra, S.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (11) : 1532 - 1546
  • [9] The Vehicle Routing Problem with Divisible Deliveries and Pickups
    Nagy, Gabor
    Wassan, Niaz A.
    Speranza, M. Grazia
    Archetti, Claudia
    [J]. TRANSPORTATION SCIENCE, 2015, 49 (02) : 271 - 294
  • [10] Vehicle Routing Problem Simultaneous Deliveries and Pickups with Split Loads and Time Windows
    Wang, Yong
    Ma, Xiaolei
    Lao, Yunteng
    Wang, Yinhai
    Mao, Haijun
    [J]. TRANSPORTATION RESEARCH RECORD, 2013, (2378) : 120 - 128