An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management

From MaRDI portal
Revision as of 22:22, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4346346

DOI10.1287/opre.44.6.951zbMath0879.90091OpenAlexW2076355050MaRDI QIDQ4346346

Raymond K. Cheung, Warren B. Powell

Publication date: 25 January 1998

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

Full work available at URL: https://semanticscholar.org/paper/d0e58cee736cec6e1f97107905d15854c9f8d8ff




Related Items (21)

An arc-exchange decomposition method for multistage dynamic networks with random arc capacitiesThe vehicle allocation problem: alternative formulation and branch-and-price methodPerspectives of approximate dynamic programmingDynamic fleet management as a logistics queueing networkSingle-commodity network design with random edge capacitiesShort-term liner ship fleet planning with container transshipment and uncertain container shipment demandDynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational ResultsFacets of the Stochastic Network Flow ProblemA new multi-objective optimization formulation for rail-car fleet sizing problemsOptimal empty vehicle repositioning and fleet-sizing for two-depot service systemsA successive convex approximation method for multistage workforce capacity planning problem with turnoverPayload-based fleet optimization for rail cars in the chemical industryA new separable piecewise linear learning algorithm for the stochastic empty container repositioning problemA labeling method for dynamic driver-task assignment with uncertain task durationsA dynamic vehicle routing problem with time-dependent travel timesA general system theory approach to rail freight car fleet sizingA duality-based relaxation and decomposition approach for inventory distribution systemsPlanning models for freight transportationDynamic control of multicommodity fleet management problemsMonge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation ProblemA tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions







This page was built for publication: An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management