A path-based capacitated network flow model for empty railcar distribution
| Autor: | Emanuel Melachrinoudis, Ruhollah Heydari |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
050210 logistics & transportation
Business requirements Transportation planning Operations research Computer science 05 social sciences General Decision Sciences 010501 environmental sciences Management Science and Operations Research Flow network 01 natural sciences Supply and demand 0502 economics and business Path (graph theory) Routing (electronic design automation) Simulation 0105 earth and related environmental sciences Block (data storage) |
| Zdroj: | Annals of Operations Research. 253:773-798 |
| ISSN: | 1572-9338 0254-5330 |
| DOI: | 10.1007/s10479-016-2259-4 |
| Popis: | In this paper we develop a novel formulation for the empty railcar distribution problem that considers realistic technical and business requirements while assigning empty cars to customer demands. The proposed model takes block and train capacities into account, while satisfying the supply and demand constraints, and allows car substitutability among pools of the same car type as well as customer preferences towards different pools. Following the practice in US railroads, the proposed model does not combine car routing and car distribution decisions. Those two decisions are separated from each other and they are usually made by different departments in US railroads. The model is implemented in CPLEX Concert Technology using Java and is illustrated in a numerical example. Results show that the proposed model can improve several performance measures over the noncapacitated model which is currently used by industry. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink