New approaches for solving the block‐to‐train assignment problem
From MaRDI portal
Publication:5433192
DOI10.1002/net.20195zbMath1144.90436OpenAlexW4237186906MaRDI QIDQ5433192
Ravindra K. Ahuja, Krishna C. Jha, Güvenç Şahin
Publication date: 8 January 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20195
heuristicsLagrangian relaxationtransportationshortest pathcombinatorial optimizationassignment problemsmixed integer programmingrailroad scheduling
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (10)
Integrating traffic routing optimization and train formation plan using simulated annealing algorithm ⋮ A mathematical formulation and an <scp>LP‐based</scp> neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem ⋮ A path-based capacitated network flow model for empty railcar distribution ⋮ Constraint-based very large-scale neighborhood search ⋮ Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem ⋮ Solving railroad blocking problem using ant colony optimization algorithm ⋮ The single train shortest route problem in a railyard ⋮ Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities ⋮ A fuzzy railroad blocking model with genetic algorithm solution approach for Iranian railways ⋮ Demand-oriented integration optimization of train timetabling and rolling stock circulation planning with flexible train compositions: a column-generation-based approach
Uses Software
Cites Work
This page was built for publication: New approaches for solving the block‐to‐train assignment problem
