Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem

DOI10.1287/IJOC.1100.0384MaRDI QIDQ2899106zbMATH OpenOpenAlexFDO

Authors Faramroze G. Engineer, G. L. Nemhauser, Martin W. P. Savelsbergh

Publication date 28 July 2012

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

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

zbMATH Keywords

column generationdial-a-flightdynamic programmingtime-expanded networks

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Recommendations

• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
• Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
• Dynamic programming algorithms for the elementary shortest path problem with resource constraints
• Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context

Cited in

(5)

• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
• Solving a dial-a-flight problem using composite variables
• Monge properties, optimal greedy policies, and policy improvement for the dynamic stochastic transportation problem
• Facets of the stochastic network flow problem
• Lexicographic column generation with a tree search pricing algorithm

This page was built for publication: Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem

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