Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems

DOI10.1287/IJOC.2022.0214MaRDI QIDQ6202345zbMATH OpenOpenAlexFDO

Authors Nicola Bianchessi, Timo Gschwind, Stefan Irnich

Publication date 26 March 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2022.0214

zbMATH Keywords

column generationinteger programmingresource windows reductionvariable fixingvehicle routing

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Path-reduced costs for eliminating arcs in routing and scheduling
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Shortest Path Problems with Resource Constraints
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows

Cited in

(1)

• Subset-row inequalities and unreachability in path-based formulations for vehicle routing and scheduling problems

This page was built for publication: Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems

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