Integrated planning of inbound and outbound logistics with a Rich Vehicle Routing Problem with backhauls

被引:24
|
作者
Marques, Alexandra [1 ]
Soares, Ricardo [2 ]
Santos, Maria Joao [2 ]
Amorim, Pedro [2 ]
机构
[1] INESC TEC, INESC Technol & Sci, P-4200465 Porto, Portugal
[2] Univ Porto, Fac Engn, FEUP, INESC TEC, P-4200465 Porto, Portugal
关键词
Logistics planning; Vehicle routing with backhauls; Rich vehicle routing; Forest industry; DELIVERY PROBLEM; SEARCH; SINGLE; PICKUP; TRANSPORTATION; FORMULATION; INVENTORY; ALGORITHM; FLEET;
D O I
10.1016/j.omega.2019.102172
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses the integration of the planning decisions concerning inbound logistics in an industrial setting (from the suppliers to the mill) and outbound logistics (from the mill to customers). The goal is to find the minimum cost routing plan, which includes the cost-effective outbound and inbound daily routes (OIRs), consisting of a sequence of deliveries of customer orders, pickup of a full truck-load at a supplier, and its delivery to the mill. This study distinguishes between three planning strategies: opportunistic backhauling planning (OBP), integrated inbound and outbound planning (IIOP) and decoupled planning (DIOP), the latter being the commonly used, particularly in the case of the wood-based panel industry under study. From the point of view of process integration, OBP can be considered as an intermediate stage from DIOP to IIOP. The problem is modelled as a Vehicle Routing Problem with Backhauls, enriched with case-specific rules for visiting the backhaul, split deliveries to customers and the use of a heterogeneous fleet. A new fix-and-optimise matheuristic is proposed for this problem, seeking to obtain good quality solutions within a reasonable computational time. The results from its application to the wood-based panel industry in Portugal show that IIOP can help to reduce total costs in about 2.7%, when compared with DIOP, due to better use of the delivery truck and a reduction of the number of dedicated inbound routes. Regarding OBP, fostering the use of OIRs does not necessarily lead to better routing plans than DIOP, as it depends upon a favourable geographical configuration of the set of customers to be visited in a day, specifically, the relative distance between a linehaul that can be visited last in a route, a neighboring backhaul, and a mill. The paper further provides valuable managerial insights on how the routing plan is impacted by the values of business-related model parameters which are set by the planner with some degree of uncertainty. Results suggest that increasing the maximum length of the route will likely have the largest impact in reducing transportation costs. Moreover, increasing the value of a reward paid for visiting a backhaul can foster the percentage of OIR in the optimal routing plan. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:18
相关论文
共 50 条
  • [31] A heuristic algorithm for multiple depots vehicle routing problem with backhauls
    Fan, Jianhua
    Wang, Xiufeng
    Chen, Qiushuang
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 3, PROCEEDINGS, 2007, : 421 - +
  • [32] Study on Hybrid Heuristic Algorithm for Vehicle Routing Problem with Backhauls
    Ren Chunyu
    Sun Jinying
    Wang xiaobo
    2009 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND COMPUTER SCIENCE, VOL 1, PROCEEDINGS, 2009, : 429 - +
  • [33] Reoptimization Strategies for a Dynamic Vehicle Routing Problem with Mixed Backhauls
    Ninikas, George
    Minis, Ioannis
    NETWORKS, 2014, 64 (03) : 214 - 231
  • [34] Integrated Inbound Vehicle Routing and Scheduling Under a Fixed Outbound Schedule at a Multi-Door Cross-Dock Terminal
    Liao, Thunshun W.
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (08) : 13217 - 13229
  • [35] The consistent electric-Vehicle routing problem with backhauls and charging management
    Nolz, Pamela C.
    Absi, Nabil
    Feillet, Dominique
    Seragiotto, Clovis
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 302 (02) : 700 - 716
  • [36] The Effect of Limited Resources in the Dynamic Vehicle Routing Problem with Mixed Backhauls
    Ninikas, Georgios
    Minis, Ioannis
    INFORMATION, 2020, 11 (09)
  • [37] A New Mathematical Model for the Vehicle Routing Problem with Backhauls and Time Windows
    Quila, Daniela
    Morillo, Daniel
    Cabrera, Guillermo
    Linfati, Rodrigo
    Gatica, Gustavo
    INFORMATION TECHNOLOGY AND SYSTEMS, ICITS 2020, 2020, 1137 : 46 - 53
  • [38] A deterministic iterated local search algorithm for the vehicle routing problem with backhauls
    José Brandão
    TOP, 2016, 24 : 445 - 465
  • [39] A mixed integer linear programming formulation for the vehicle routing problem with backhauls
    Granada-Echeverri, Mauricio
    Toro, Eliana M.
    Santa, Jhon Jairo
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2019, 10 (02) : 295 - 308
  • [40] Self-organizing feature maps for the vehicle routing problem with backhauls
    Hassan Ghaziri
    Ibrahim H. Osman
    Journal of Scheduling, 2006, 9 : 97 - 114