Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem

DOI10.1002/NET.22115MaRDI QIDQ6085887zbMATH OpenOpenAlexFDO

Authors Luca Bertazzi, Xingyin Wang

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

zbMATH Keywords

matheuristicssplit delivery CVRPunsplit CVRPworst-case analysis

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Split delivery routing
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• An iterated local search heuristic for the split delivery vehicle routing problem

Cites work

• A column generation approach for the split delivery vehicle routing problem
• A concise guide to existing and emerging vehicle routing problem variants
• A generic exact solver for vehicle routing and related problems
• A Location Based Heuristic for General Routing Problems
• A novel approach to solve the split delivery vehicle routing problem
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A survey on matheuristics for routing problems
• Approximation algorithms for VRP with stochastic demands
• Bounds and Heuristics for Capacitated Routing Problems
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1749224 (Why is no real title available?)
• scientific article; zbMATH DE number 956789 (Why is no real title available?)
• Improved branch-cut-and-price for capacitated vehicle routing
• New benchmark instances for the capacitated vehicle routing problem
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• The bin packing problem with item fragmentation: a worst-case analysis
• The truck dispatching problem
• Vehicle Routing

Cited in

(3)

• Matheuristic algorithms for the inventory routing problem with unsplit and split deliveries
• Estimating optimal split delivery vehicle routing problem solution values
• Accurately estimating optimal SDVRP solution values using regression models

This page was built for publication: Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085887)