Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
From MaRDI portal
Publication:6085887
DOI10.1002/net.22115OpenAlexW4283698962MaRDI QIDQ6085887
Publication date: 12 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22115
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- New benchmark instances for the capacitated vehicle routing problem
- A concise guide to existing and emerging vehicle routing problem variants
- A generic exact solver for vehicle routing and related problems
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Improved branch-cut-and-price for capacitated vehicle routing
- The bin packing problem with item fragmentation: a worst-case analysis
- A survey on matheuristics for routing problems
- The Truck Dispatching Problem
- Technical Note—Approximation Algorithms for VRP with Stochastic Demands
- Vehicle Routing
- A novel approach to solve the split delivery vehicle routing problem
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Bounds and Heuristics for Capacitated Routing Problems
- A Location Based Heuristic for General Routing Problems
- A column generation approach for the split delivery vehicle routing problem
This page was built for publication: Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
