A Multicircle Order Acceptance Strategy for Dynamic Vehicle Routing Problems Considering Customer Choice of Last-Mile Delivery Modes and Time Slots

Author(s):  
Hanguang Qiu ◽  
Cejun Cao ◽  
Jie Zhen ◽  
Hongyong Fu ◽  
Jixiang Zhou

A multicircle order acceptance strategy was proposed to decide whether to accept customer requests for specific last-mile delivery modes (including attended home or reception box delivery) and time slots. The strategy was composed of initializing acceptable time slot allocations, reallocating acceptable time slots, matching reference sites, and assessing time slot deviations. A strategy-oriented insertion algorithm for dynamic vehicle routing problems with hard time windows was constructed, thereby showing the proposed strategy achieves a better balance between revenue and distance than the “first come and first served” strategy. Always accepting global optimization result is not significantly better than adopting the result conditionally or based on simulated annealing theory. The distance and revenue gradually increase with the number of reference sites, while revenue/distance ratio decreases. The vehicles are available to serve more attended home delivery orders with a gradual increase in time slot interval, thereby leading to an increase of AHD and total revenue.

2021 ◽  
pp. 107604
Author(s):  
Brenner Humberto Ojeda Rios ◽  
Eduardo C. Xavier ◽  
Flávio K. Miyazawa ◽  
Pedro Amorim ◽  
Eduardo Curcio ◽  
...  

2014 ◽  
pp. 299-347 ◽  
Author(s):  
Tolga Bekta¸s ◽  
Panagiotis P. Repoussis ◽  
Christos D. Tarantilis

Kybernetes ◽  
2019 ◽  
Vol 49 (4) ◽  
pp. 1267-1284 ◽  
Author(s):  
Yandong He ◽  
Xu Wang ◽  
Fuli Zhou ◽  
Yun Lin

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.


2019 ◽  
Vol 52 (19) ◽  
pp. 359-364
Author(s):  
N.W. Klein Koerkamp ◽  
C. Borst ◽  
Max Mulder ◽  
M.M. van Paassen

Sign in / Sign up

Export Citation Format

Share Document