Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Interest
Topics
Details

Details

003
Publications

2021

A bilevel approach for the collaborative transportation planning problem

Authors
Santos, MJ; Curcio, E; Amorim, P; Carvalho, M; Marques, A;

Publication
International Journal of Production Economics

Abstract
The integration of the outbound and the inbound logistics of a company leads to a large transportation network, allowing to detect backhauling opportunities to increase the efficiency of the transportation. In collaborative networks, backhauling is used to find profitable services in the return trip to the depot and to reduce empty running of vehicles. This work investigates the vertical collaboration between a shipper and a carrier for the planning of integrated inbound and outbound transportation. Based on the hierarchical nature of the relation between the shipper and the carrier and their different goals, the problem is formulated as a bilevel Vehicle Routing Problem with Selective Backhauls (VRPSB). At the upper level, the shipper decides the minimum cost delivery routes and the set of incentives offered to the carrier to perform integrated routes. At the lower level, the carrier decides which incentives are accepted and on which routes the backhaul customers are visited. We devise a mathematical programming formulation for the bilevel VRPSB, where the routing and the pricing problems are optimized simultaneously, and propose an equivalent reformulation to reduce the problem to a single-level VRPSB. The impact of collaboration is evaluated against non-collaborative approaches and two different side payment schemes. The results suggest that our bilevel approach leads to solutions with higher synergy values than the approaches with side payments. © 2020 Elsevier B.V.

2021

A green lateral collaborative problem under different transportation strategies and profit allocation methods

Authors
Joa, M; Martins, S; Amorim, P; Almada Lobo, B;

Publication
JOURNAL OF CLEANER PRODUCTION

Abstract
Collaboration between companies in transportation problems seeks to reduce empty running of vehicles and to increase the use of vehicles' capacity. Motivated by a case study in the food supply chain, this paper examines a lateral collaboration between a leading retailer (LR), a third party logistics provider (3 PL) and different producers. Three collaborative strategies may be implemented simultaneously, namely pickup-delivery, collection and cross-docking. The collaborative pickup-delivery allows an entity to serve customers of another in the backhaul trips of the vehicles. The collaborative collection allows loads to be picked up at the producers in the backhauling routes of the LR and the 3 PL, instead of the traditional outsourcing. The collaborative cross-docking allows the producers to cross-dock their cargo at the depot of another entity, which is then consolidated and shipped with other loads, either in linehaul or backhaul routes. The collaborative problem is formulated with three different objective functions: minimizing total operational costs, minimizing total fuel consumption and minimizing operational and CO2 emissions costs. The synergy value of collaborative solutions is assessed in terms of costs and environmental impact. Three proportional allocation methods from the literature are used to distribute the collaborative gains among the entities, and their limitations and capabilities to attend fairness criteria are analyzed. Collaboration is able to reduce the global fuel consumption in 26% and the global operational costs in 28%, independently of the objective function used to model the problem. The collaborative pickup-delivery strategy outperforms the other two in the majority of instances under different objectives and parameter settings. The collaborative collection is favoured when the ordering loads from producers increase. The collaborative cross-docking tends to be implemented when the producers are located close to the depot of the 3 PL.

2021

Recent dynamic vehicle routing problems: A survey

Authors
Ojeda Rios, BH; Xavier, EC; Miyazawa, FK; Amorim, P; Curcio, E; Santos, MJ;

Publication
Computers and Industrial Engineering

Abstract
Technological advances in the last two decades have aroused great interest in the class of dynamic vehicle routing problems (DVRPs), which is reflected in the significant growth of the number of articles published in this period. Our work presents a comprehensive review of the DVRP literature of the last seven years (2015–2021) focusing mainly on applications and solution methods. Consequently, we provide a taxonomy of the problem and a taxonomy of the related solution methods. The papers considered for this review are discussed, analyzed in detail and classified according to the proposed taxonomies. The results of the analysis reveal that 65% of the articles deal with dynamic and stochastic problems (DS) and 35% with dynamic and deterministic problems (DD). With respect to applications, 40% of articles correspond to the transportation of goods, 17.5% to services, 17.5% to the transport of people and 25% to generic applications. Among the solution methods, heuristics and metaheuristics stand out. We discussed the application opportunities associated with DVRPs in recent business models and new concepts of logistical operations. An important part of these new applications that we found in our review is in the segment of business-to-consumer crowd-sourced services, such as peer-to-peer ride-sharing and online food ordering services. In our review many of the applications fall into the stochastic and dynamic category. This means that for many of these applications, companies usually possess historical data about the dynamic and uncertainty sources of their routing problems. Finally, we present the main solution streams associated with DVRPs. © 2021 Elsevier Ltd

2020

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

Authors
Marques, A; Soares, R; Santos, MJ; Amorim, P;

Publication
Omega

Abstract

2020

A robust optimization approach for the vehicle routing problem with selective backhauls

Authors
Santos, MJ; Curcio, E; Mulati, MH; Amorim, P; Miyazawa, FK;

Publication
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW

Abstract
The Vehicle Routing Problem with Selective Backhauls (VRPSB) aims to minimize the total routing costs minus the total revenue collected at backhaul customers. We explore a VRPSB under uncertain revenues. A deterministic VRPSB is formulated as a mixed-integer programming problem and two robust counterparts are derived. A novel method to estimate the probabilistic bounds of constraint violation is designed. A robust metaheuristic is developed, requiring little time to obtain feasible solutions with average gap of 1.40%. The robust approach studied demonstrates high potential to tackle the problem, requiring similar computing effort and maintaining the same tractability as the deterministic modeling.