New approaches for solving the block‐to‐train assignment problem

DOI10.1002/NET.20195zbMATH Open1144.90436OpenAlexW4237186906MaRDI QIDQ5433192FDOQ5433192

Authors Krishna C. Jha, Ravindra K. Ahuja, 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

zbMATH Keywords

heuristicscombinatorial optimizationassignment problemsshortest pathtransportationmixed integer programmingLagrangian relaxationrailroad scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• Modeling formulation and a new heuristic for the railroad blocking problem
• Solving railway track allocation problems
• Models for railway track allocation
• Modelling and solving a train path assignment model
• Column generation for multi-matrix blocking problems

Cites Work

• Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation

Cited In (17)

• Column generation for multi-matrix blocking problems
• Integrating traffic routing optimization and train formation plan using simulated annealing algorithm
• Solving railroad blocking problem using ant colony optimization algorithm
• Modelling and solving a train path assignment model
• Optimal network configuration and capacity expansion of railroads
• What are new insights using optimized train path assignment for the development of railway infrastructure?
• Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities
• Constraint-based very large-scale neighborhood search
• An improved local branching approach for train formation planning
• A fuzzy railroad blocking model with genetic algorithm solution approach for Iranian railways
• Modeling formulation and a new heuristic for the railroad blocking problem
• A mathematical formulation and an <scp>LP‐based</scp> neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem
• A branch-first, cut-second approach for locomotive assignment
• A path-based capacitated network flow model for empty railcar distribution
• Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem
• Demand-oriented integration optimization of train timetabling and rolling stock circulation planning with flexible train compositions: a column-generation-based approach
• The single train shortest route problem in a railyard

Uses Software

• CPLEX

This page was built for publication: New approaches for solving the block‐to‐train assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5433192)