A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution

2018 ◽  
Vol 265 (2) ◽  
pp. 765-778 ◽  
Author(s):  
Lin Zhou ◽  
Roberto Baldacci ◽  
Daniele Vigo ◽  
Xu Wang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Last Mile ◽  
Delivery Options

scholarly journals The last-mile vehicle routing problem with delivery options

OR Spectrum ◽  
2021 ◽  
Author(s):  
Christian Tilk ◽  
Katharina Olkis ◽  
Stefan Irnich
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Resource Constraints ◽  
Time Window ◽  
Time Windows ◽  
Service Level ◽  
Optimal Solutions ◽  
Routing Problem ◽  
Common Location ◽  
Delivery Options

AbstractThe ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some delivery options. The carrier must then select, for each request, one delivery option such that the carriers’ overall cost is minimized and a given service level regarding customer preferences is achieved. Moreover, when delivery options share a common location, e.g., a locker, capacities must be respected when assigning shipments. To solve the VRPDO exactly, we present a new branch-price-and-cut algorithm. The associated pricing subproblem is a shortest-path problem with resource constraints that we solve with a bidirectional labeling algorithm on an auxiliary network. We focus on the comparison of two alternative modeling approaches for the auxiliary network and present optimal solutions for instances with up to 100 delivery options. Moreover, we provide 17 new optimal solutions for the benchmark set for the VRP with roaming delivery locations.

Dynamic vehicle routing problem considering simultaneous dual services in the last mile delivery

Kybernetes ◽  
2019 ◽  
Vol 49 (4) ◽  
pp. 1267-1284 ◽  
Author(s):  
Yandong He ◽  
Xu Wang ◽  
Fuli Zhou ◽  
Yun Lin
Keyword(s):  
Vehicle Routing ◽  
Delivery System ◽  
Vehicle Routing Problem ◽  
Mixed Integer ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem ◽  
Content Type ◽  
Last Mile ◽  
Last Mile Delivery

Purpose This paper aims to study the vehicle routing problem with dynamic customers considering dual service (including home delivery [HD] and customer pickup [CP]) in the last mile delivery in which three decisions have to be made: determine routes that lie along the HD points and CP facilities; optimize routes in real time, which mode is better between simultaneous dual service (SDS, HD points and CP facilities are served simultaneously by the same vehicle); and respective dual service (RDS, HD points and CP facilities are served by different vehicles)? Design/methodology/approach This paper establishes a mixed integer linear programing model for the dynamic vehicle routing problem considering simultaneous dual services (DVRP-SDS). To increase the practical usefulness and solve large instances, the authors designed a two-phase matheuristic including construction-improvement heuristics to solve the deterministic model and dynamic programing to adjust routes to dynamic customers. Findings The computational experiments show that the CP facilities offer greater flexibility for adjusting routes to dynamic customers and that the SDS delivery system outperforms the RDS delivery system in terms of cost and number of vehicles used. Practical implications The results provide managerial insights for express enterprises from the perspective of operation research to make decisions. Originality/value This paper is among the first papers to study the DVRP-SDS. Moreover, this paper guides the managers to select better delivery mode in the last mile delivery.

scholarly journals GREEN LAST MILE DISTRIBUTION SYSTEM: HETEROGENEOUS FLEET VEHICLE ROUTING PROBLEM WITH TIME WINDOW AND EXTERNAL COST

2021 ◽  
pp. 1-8
Author(s):  
Nahry Nahry ◽  
Talitha Ayu
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Distribution System ◽  
Time Window ◽  
External Costs ◽  
External Cost ◽  
Negative Externalities ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Last Mile

The development of e-commerce business in Jakarta, Indonesia, in recent years has made the Last Mile Delivery (LMD) business sector develop rapidly. Increased demand for LMD makes the resulting kilometer trips even greater, resulting in negative externalities. On the other hand, logistics costs in Indonesia are only affected by vehicle operating costs and no external cost component. Optimization of LMD services that takes into account internal and external costs is needed to minimize the total cost of LMD and in reducing the impact of negative externalities. The purpose of this paper is to optimize the LMD distribution system on the Heterogeneous Fleet Vehicle Routing Problem with Time Window and External Costs (HFVRPTW-EC) models. The optimization is done by applying the HFVRPTW-EC model using data from one of the parcel delivery companies in Jakarta and then doing a simulation by forming several operational scenarios. The results show that the optimization of LMD has reduced internal and external costs by more than 50% compared to existing conditions. The detailed results show that, for the short-term program, a scenario with a one-tier distribution system and type of motorcycle vehicle can reduce total costs compared to existing conditions by 66.22% on peak day and 59.41% on off peak day. Whereas for long-term program optimization, scenarios with multiple tier distribution systems and types of motorized vehicles for drop mileage and pick up truck for stem mileage can reduce total costs by 69.23% on peak day and 60.24% on off peak day.

scholarly journals Vehicle Routing Problem with Drones for Last Mile Delivery

2019 ◽  
Vol 39 ◽  
pp. 314-324 ◽  
Author(s):  
Patchara Kitjacharoenchai ◽  
Seokcheon Lee
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Last Mile ◽  
Last Mile Delivery

scholarly journals Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Yong Zhang ◽  
Lei Shi ◽  
Jing Chen ◽  
Xuefeng Li
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Initial Period ◽  
Pso Algorithm ◽  
Automated Vehicles ◽  
Routing Problem ◽  
Automated Vehicle ◽  
Last Mile ◽  
The Cost

The application of automated vehicles in logistics can efficiently reduce the cost of logistics and reduce the potential risks in the last mile. Considering the path restriction in the initial stage of the application of automated vehicles in logistics, the conventional model for a vehicle routing problem (VRP) is modified. Thus, the automated vehicle routing problem with time windows (AVRPTW) model considering path interruption is established. Additionally, an improved particle swarm optimisation (PSO) algorithm is designed to solve this problem. Finally, a case study is undertaken to test the validity of the model and the algorithm. Four automated vehicles are designated to execute all delivery tasks required by 25 stores. Capacities of all of the automated vehicles are almost fully utilised. It is of considerable significance for the promotion of automated vehicles in last-mile situations to develop such research into real problems arising in the initial period.

Two echelon vehicle routing problem with drones in last mile delivery

2020 ◽  
Vol 225 ◽  
pp. 107598 ◽  
Author(s):  
Patchara Kitjacharoenchai ◽  
Byung-Cheol Min ◽  
Seokcheon Lee
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Last Mile ◽  
Last Mile Delivery
Sign in / Sign up

Export Citation Format

Share Document