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 条
  • [1] INTEGRATED OPTIMIZATION OF VEHICLE ROUTING OF AUTOMOTIVE PARTS INBOUND LOGISTICS
    Wu, Q.
    Su, J. F.
    Xuan, J.
    Lei, S.
    INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2023, 22 (03) : 520 - 531
  • [2] A Rich Vehicle Routing Problem for a City Logistics Problem
    Ambrosino, Daniela
    Cerrone, Carmine
    MATHEMATICS, 2022, 10 (02)
  • [3] THE VEHICLE-ROUTING PROBLEM WITH BACKHAULS
    GOETSCHALCKX, M
    JACOBSBLECHA, C
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 42 (01) : 39 - 51
  • [4] Scheduling cross docking logistics optimization problem with multiple inbound vehicles and one outbound vehicle
    Song, Kailei
    Chen, Feng
    2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 3089 - 3094
  • [5] Integrated electric logistics vehicle recharging station location-routing problem with mixed backhauls and recharging strategies
    Yang, Senyan
    Ning, Lianju
    Tong, Lu
    Shang, Pan
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2022, 140
  • [6] Upward scalable vehicle routing problem of automobile inbound logistics with pickup flexibility
    Jia, Menglei
    Chen, Feng
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2023, 177
  • [7] An exact algorithm for the vehicle routing problem with backhauls
    Toth, P
    Vigo, D
    TRANSPORTATION SCIENCE, 1997, 31 (04) : 372 - 385
  • [8] Solution strategies for the vehicle routing problem with backhauls
    Subramanian, Anand
    Queiroga, Eduardo
    OPTIMIZATION LETTERS, 2020, 14 (08) : 2429 - 2441
  • [9] An exact method for the vehicle routing problem with backhauls
    Mingozzi, A
    Giorgi, S
    Baldacci, R
    TRANSPORTATION SCIENCE, 1999, 33 (03) : 315 - 329
  • [10] A memetic algorithm for a vehicle routing problem with backhauls
    Tavakkoli-Moghadam, R.
    Saremi, A. R.
    Ziaee, M. S.
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 181 (02) : 1049 - 1060