Solving a Time-Space Network Formulation for the Convoy Movement Problem
From MaRDI portal
Publication:5322085
DOI10.1287/opre.1040.0183zbMath1165.90344OpenAlexW2172223212MaRDI QIDQ5322085
Pierre Chardaire, G. P. McKeown, S. B. Richardson, S. A. Verity-Harrison
Publication date: 18 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1040.0183
Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90) Traffic problems in operations research (90B20)
Related Items (4)
Computational complexity of convoy movement planning problems ⋮ From the physics of interacting polymers to optimizing routes on the London Underground ⋮ Optimal inventory level control and replenishment plan for retailers ⋮ Optimal scheduling of emergency roadway repair and subsequent relief distribution
This page was built for publication: Solving a Time-Space Network Formulation for the Convoy Movement Problem