A study on the pickup and delivery problem with time windows: matheuristics and new instances
From MaRDI portal
Publication:2664415
DOI10.1016/j.cor.2020.105065zbMath1458.90136OpenAlexW3046108969MaRDI QIDQ2664415
Carlo S. Sartori, Luciana S. Buriol
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105065
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows ⋮ Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The pickup and delivery problem with time windows
- The late acceptance hill-climbing heuristic
- Pickup and delivery problem with time windows: a new compact two-index formulation
- Efficiently solving very large-scale routing problems
- New benchmark instances for the capacitated vehicle routing problem
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
- A computer assistant for vehicle dispatching with learning capabilities
- A generic exact solver for Vehicle Routing and related problems
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- The Truck Dispatching Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- The General Pickup and Delivery Problem
- Metaheuristics—the metaphor exposed
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
This page was built for publication: A study on the pickup and delivery problem with time windows: matheuristics and new instances
