A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
From MaRDI portal
Publication:2083929
DOI10.1016/j.ejor.2022.05.022OpenAlexW3215824593MaRDI QIDQ2083929
Katharina Olkis, Christian Tilk, Fabien Lehuédé, Stefan Irnich, Dorian Dumez, Olivier Péton
Publication date: 17 October 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.2022.05.022
Uses Software
Cites Work
- Workforce scheduling and routing problems: literature survey and computational study
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- The dial-A-ride problem with transfers
- A survey on two-echelon routing problems
- A heuristic to solve the synchronized log-truck scheduling problem
- A large neighbourhood based heuristic for two-echelon routing problems
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- A hybrid constraint programming approach to the log-truck scheduling problem
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- A unified heuristic for a large class of vehicle routing problems with backhauls
- A general heuristic for vehicle routing problems
- Variable neighbourhood search: methods and applications
- A powerful route minimization heuristic for the vehicle routing problem with time windows
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- Home health care routing and scheduling: a review
- Resource constrained routing and scheduling: review and research prospects
- New valid inequalities for the two-echelon capacitated vehicle routing problem
- Justification and RCPSP: a technique that pays
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach
- A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Synchronizing vans and cargo bikes in a city distribution network
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- Resource extension functions: properties, inversion, and generalization to segments
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Split Delivery Vehicle Routing Problem: A Survey
- Vehicle Routing for Small Package Delivery and Pickup Services
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries
- An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows
