A tailored Benders decomposition approach for last-mile delivery with autonomous robots
From MaRDI portal
Publication:2077920
DOI10.1016/j.ejor.2021.06.048zbMath1490.90033OpenAlexW3174853550MaRDI QIDQ2077920
Ivana Ljubić, Laurent Alfandari, Marcos de Melo da Silva
Publication date: 23 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.06.048
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items
A mixed truck and robot delivery approach for the daily supply of customers ⋮ Directions for future research on urban mobility and city logistics ⋮ A review of decentralized optimization focused on information flows of decomposition algorithms ⋮ Routing problems with electric and autonomous vehicles: review and potential for future research ⋮ The multi-vehicle truck-and-robot routing problem for last-mile delivery
Uses Software
Cites Work
- Unnamed Item
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A survey on two-echelon routing problems
- MIP models for connected facility location: a theoretical and computational study
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- On implementing the push-relabel method for the maximum flow problem
- Scheduling last-mile deliveries with truck-based autonomous robots
- Thinning out Steiner trees: a node-based model for uniform edge costs
- The traveling purchaser problem and its variants
- Locating median cycles in networks
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- A note on the selection of Benders' cuts
- Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions
- Hub Location as the Minimization of a Supermodular Set Function
- Vehicle Routing
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
- Tailoring Benders decomposition for uncapacitated network design
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Variable Neighborhood Search
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
