EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1418. A Two-Echelon Vehicle Routing Problem with Mobile Satellites and Multiple Commodities
Invited abstract in session MD-52: Scheduling and Routing Problems , stream Combinatorial Optimization.
Monday, 14:30-16:00Room: 8003 (building: 202)
Authors (first author is the speaker)
1. | Aria Dahimi
|
IE&IS, Eindhoven University of Technology | |
2. | Virginie Lurkin
|
HEC, University of Lausanne | |
3. | Mehrdad Mohammadi
|
Department of Industrial Engineering and Innovation Sciences, Eindhoven University of Technology | |
4. | Tom van Woensel
|
Technische Universiteit Eindhoven |
Abstract
The surge in last-mile delivery demands, driven by the growth of e-commerce, poses intricate challenges in meeting tight schedules, navigating congested urban areas, and addressing environmental concerns. In this study we introduce an approach to address a part of last-mile delivery challenges by integrating a mobile two-echelon strategy. We extend traditional two-echelon systems to consider multiple depots, multiple commodities, and flexible meeting points (mobile satellites). To solve this complex problem, we propose a mixed-integer linear programming (MILP) model and a math-heuristic algorithm, SALNS, combining large neighborhood search (LNS), LP scheduling, and a novel schedule approximation method. Comprehensive experiments demonstrate the algorithm's efficiency, achieving identical or superior results to exact benchmarks while running, on average, nine times faster. Notably, the algorithm robustly generates feasible solutions for medium and large instances in practical times. Furthermore, sensitivity analyses reveal the critical roles of fuel, wage, and time-window parameters in shaping delivery strategies, providing valuable insights for decision-makers.
Keywords
- Vehicle Routing
- Logistics
- Scheduling
Status: accepted
Back to the list of papers