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

被引:0
|
作者
Yang Y.-Z. [1 ]
Jin W.-Z. [2 ]
Hao X.-N. [2 ]
Tian S. [2 ]
机构
[1] School of Business Administration, South China University of Technology, Guangzhou 510640, Guangdong
[2] School of Civil Engineering and Transportation, South China University of Technology, Guangzhou 510640, Guangdong
关键词
Handling mixture; Heuristic algorithm; Pickup and delivery; Route optimization;
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
页数:5
相关论文
共 50 条
  • [31] The vehicle routing problem with pickups and deliveries on some special graphs
    Tzoreff, TE
    Granot, D
    Granot, F
    Sosic, G
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 116 (03) : 193 - 229
  • [32] Metaheuristics for the Single Vehicle Routing Problem with Deliveries and Selective Pickups
    Bruck, Bruno Petrato
    dos Santos, Andre Gustavo
    Claudio Arroyo, Jose Elias
    [J]. 2012 12TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA), 2012, : 723 - 728
  • [33] Capacitated vehicle routing problem for multi-product cross-docking with split deliveries and pickups
    Hasani-Goodarzi, Asefeh
    Tavakkoli-Moghaddam, Reza
    [J]. WORLD CONFERENCE ON BUSINESS, ECONOMICS AND MANAGEMENT (BEM-2012), 2012, 62 : 1360 - 1365
  • [34] Heuristic algorithms for single and multiple depot Vehicle Routing Problems with Pickups and Deliveries
    Nagy, G
    Salhi, S
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 162 (01) : 126 - 141
  • [35] A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
    Gutierrez-Jarpa, Gabriel
    Desaulniers, Guy
    Laporte, Gilbert
    Marianov, Vladimir
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (02) : 341 - 349
  • [36] An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows
    Lai Mingyong
    Cao Erbao
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2010, 23 (02) : 188 - 195
  • [37] Hybrid metaheuristic for the single vehicle routing problem with deliveries and selective pickups
    Bruck, Bruno Petrato
    dos Santos, Andre Gustavo
    Claudio Arroyo, Jose Elias
    [J]. 2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [38] Hybrid approach for the Multiple Vehicle Routing Problem with Deliveries and Selective Pickups
    Bruck, Bruno Petrato
    dos Santos, Andre Gustavo
    [J]. 2012 12TH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS (HIS), 2012, : 265 - 270
  • [39] A Two-Stage Hybrid Heuristic for Vehical Routing Problem with Pickups and Deliveries
    Hong, Bigang
    Liu, Changshi
    [J]. 2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 1, PROCEEDINGS, 2009, : 92 - +
  • [40] Green reverse logistics: Exploring the vehicle routing problem with deliveries and pickups
    Santos, Maria Joao
    Jorge, Diana
    Ramos, Tania
    Barbosa-Povoa, Ana
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 118