A path-based capacitated network flow model for empty railcar distribution
From MaRDI portal
Recommendations
- A case study in empty railcar distribution
- New results on the migrativity properties for overlap (grouping) functions and uninorms
- Solving a multi periodic stochastic model of the rail-car fleet sizing by two-stage optimization formulation
- Shunting minimal rail car allocation
- Solving a freight railcar flow problem arising in Russia
Cites work
- A tactical decision support system for empty railcar management
- An application of genetic and tabu searches to the freight railroad operating plan problem
- Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- Improved empty freight car distribution
- Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
- New approaches for solving the block‐to‐train assignment problem
Cited in
(4)
This page was built for publication: A path-based capacitated network flow model for empty railcar distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1695776)