Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
From MaRDI portal
Publication:6168592
DOI10.1016/j.ejor.2023.04.018OpenAlexW4365813688MaRDI QIDQ6168592
Sarah K. Schaumann, Matthias Winkenbach, Felix M. Bergmann, Stephan M. Wagner
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.04.018
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic design of sales territories
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A general heuristic for vehicle routing problems
- The pickup and delivery problem with time windows
- Estimating the Held-Karp lower bound for the geometric TSP
- Total distance approximations for routing solutions
- Smart scheduling: an integrated first mile and last mile supply approach
- Continuous approximation models in freight distribution management
- A survey of the standard location-routing problem
- Exact algorithms for the multi-pickup and delivery problem with time windows
- The multi-vehicle profitable pickup and delivery problem
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- A unified solution framework for multi-attribute vehicle routing problems
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- A survey of variants and extensions of the location-routing problem
- A review of vehicle routing with simultaneous pickup and delivery
- The Truck Dispatching Problem
- Drive: Dynamic Routing of Independent Vehicles
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- An Asymptotic, Probabilistic Analysis of a Routing Problem
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- The General Pickup and Delivery Problem
- An Introduction to Statistical Learning
- Reducibility among Combinatorial Problems
- New Bounds for the Traveling Salesman Constant
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- The Traveling-Salesman Problem
- Continuum approximation techniques for the design of integrated package distribution systems
- A Lower Bound for the Expected Travel Among $m$ Random Points
