A path-based capacitated network flow model for empty railcar distribution
From MaRDI portal
Publication:1695776
DOI10.1007/s10479-016-2259-4zbMath1380.90044OpenAlexW2513560665MaRDI QIDQ1695776
Emanuel Melachrinoudis, Ruhollah Heydari
Publication date: 8 February 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2259-4
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- An application of genetic and tabu searches to the freight railroad operating plan problem
- Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
- Improved Empty Freight Car Distribution
- A Tactical Decision Support System for Empty Railcar Management
- New approaches for solving the block‐to‐train assignment problem
- Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers