Preprocessing to reduce vehicle capacity for routing problems

DOI10.1007/s43069-023-00220-9zbMath1519.90251MaRDI QIDQ6097441

Twan Dollevoet, Remy Spliet

Publication date: 5 June 2023

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-023-00220-9

zbMATH Keywords

capacity; vehicle routing; preprocessing

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90C27: Combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• On the complexity of the separation problem for rounded capacity inequalities
• New benchmark instances for the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Probabilistic diversification and intensification in local search for vehicle routing
• Improved branch-cut-and-price for capacitated vehicle routing
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Vehicle Routing
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Reducibility among Combinatorial Problems
• Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning