Simulated annealing: theory and applications
Simulated annealing: theory and applications
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Modern heuristic techniques for combinatorial problems
A Simplex-Based Tabu Search Method for Capacitated Network Design
INFORMS Journal on Computing
Efficient Circulation of Railway Rolling Stock
Transportation Science
Rotation planning of locomotive and carriage groups with shared capacities
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Models and algorithms for the train unit assignment problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A Lagrangian heuristic for a train-unit assignment problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
In the context of organizing timetables for railway companies the following railway carriage routing problem occurs. Given a timetable containing rail links with departure and destination times/stations and the composition of the trains, find a routing of railway carriages such that the required carriages are always available when a train departs. The problem is formulated as an integer multi-commodity network flow problem with nonlinear objective function. We will present a local search approach for this NP-hard problem. The approach uses structural properties of the integer multi-commodity network flow formulation of the problem. Computational results for a real world instance are given.