AN EXACT ALGORITHM FOR THE FULL TRUCKLOAD PICK-UP AND DELIVERY PROBLEM WITH TIME WINDOWS: CONCEPT AND IMPLEMENTATION DETAILS

被引:0
|
作者
Janssens, Gerrit K. [1 ]
Braekers, Kris [1 ]
机构
[1] Univ Hasselt, Hasselt Univ, Transportat Res Inst IMOB, B-3590 Diepenbeek, Belgium
关键词
Exact algorithm; full truckload; pick-up and delivery; set partitioning;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Intermodal goods transport is characterized by a main transport by rail, barge or seaborne vessel, preceded and followed by short in time but expensive road transport. Many times trucks pick-up or deliver a single container which leads to a full truckload vehicle routing problem in terms of economically efficient transport services. Time windows induced by the customer or due to external situations increase the complexity of an efficient planning by a logistics provider. An exact algorithm for this type of pick-up and delivery problem is developed and the details of its implementation are explained. A set partitioning problem is automatically generated and solved by means of the Lingo software.
引用
收藏
页码:257 / 262
页数:6
相关论文
共 50 条
  • [1] Dynamic Truckload Pick-up and Delivery Problem with Time Windows
    Zhou, C. F.
    [J]. MANUFACTURING PROCESS AND EQUIPMENT, PTS 1-4, 2013, 694-697 : 3558 - 3561
  • [2] A hybrid intelligent algorithm for vehicle pick-up and delivery problem with time windows
    Liao Li
    Wu Yaohua
    Hu Hongchun
    Xiao Jiwei
    [J]. PROCEEDINGS OF THE 26TH CHINESE CONTROL CONFERENCE, VOL 3, 2007, : 469 - +
  • [3] An Evolutionary Ant Colony Algorithm for a Vehicle Routing Problem with Simultaneous Pick-up and Delivery and Hard Time Windows
    Pu, Xingcheng
    Wang, Keli
    [J]. PROCEEDINGS OF THE 30TH CHINESE CONTROL AND DECISION CONFERENCE (2018 CCDC), 2018, : 6499 - 6503
  • [4] A PARALLEL BRANCH-AND-PRICE ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND SIMULTANEOUS DELIVERY AND PICK-UP
    Li, Chen
    Long, Lei
    Chen, Qiushuang
    Hua, Yanning
    [J]. PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2008, : 1334 - 1343
  • [5] A HYBRID CONSTRAINT PROGRAMMING/LOCAL SEARCH APPROACH TO THE PICK-UP AND DELIVERY PROBLEM WITH TIME WINDOWS
    Guimarans, Daniel
    Ramos, Juan Jose
    Wallace, Mark
    Riera, Daniel
    [J]. EMSS 2009: 21ST EUROPEAN MODELING AND SIMULATION SYMPOSIUM, VOL I, 2009, : 111 - +
  • [6] Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO
    Gan, Xiaobing
    Wang, Yan
    Li, Shuhai
    Niu, Ben
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
  • [7] THE TEAM ORIENTEERING PICK-UP AND DELIVERY PROBLEM WITH TIME WINDOWS AND ITS APPLICATIONS IN FLEET SIZING
    Baklagis, D. G.
    Dikas, G.
    Minis, I.
    [J]. RAIRO-OPERATIONS RESEARCH, 2016, 50 (03) : 503 - 517
  • [8] A branch-and-cut algorithm for a skip pick-up and delivery problem
    Belenguer, Jose M.
    Cubillos, Maximiliano
    Wohlk, Sanne
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2024, 168
  • [9] THE MIXED ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICK-UP AND DELIVERY
    Zhang, Tao
    Zhang, Yue-Jie
    Chen, Qi
    Sun, Yan
    [J]. PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6, 2009, : 1871 - +
  • [10] GENETIC ALGORITHM FOR THE PICK-UP AND DELIVERY PROBLEM WITH TIME WINDOW BY MULTI-COMPARTMENT VEHICLES
    Ousmane, Berte
    Moustapha, Diaby
    Adama, Coulibaly
    [J]. TRANSPORT AND TELECOMMUNICATION JOURNAL, 2021, 22 (03) : 343 - 352