Print Email Facebook Twitter Cost optimal allocation of rail passenger lines Title Cost optimal allocation of rail passenger lines Author Claessens, M.T. van Dijk, N.M. Zwaneveld, P.J. Instituut voor Ruimtelijke Organisatie TNO Publication year 1998 Abstract We consider the problem of cost optimal railway line allocation for passenger trains for the Dutch railway system. At present, the allocation of passenger lines by Dutch Railways is based on maximizing the number of direct travelers. This paper develops an alternative approach that takes operating costs into account. A mathematical programming model is developed which minimizes the operating costs subject to service constraints and capacity requirements. The model optimizes on lines, line types, routes, frequencies and train lengths. First, the line allocation model is formulated as an integer nonlinear programming model. This model is transformed into an integer linear programming model with binary decision variables. An algorithm is presented which solves the problem to optimality. The algorithm is based upon constraint satisfaction and a Branch and Bound procedure. The algorithm is applied to a subnetwork of the Dutch railway system for which it shows a substantial cost reduction. Further application and extension seem promising. © 1998 Elsevier Science B.V. All rights reserved. Subject Branch and boundOptimizationAlgorithmsConstraint theoryDecision theoryInteger programmingLinear programmingMathematical modelsNonlinear programmingPassenger carsProblem solvingRailroad transportationBranch and bound procedureCost optimal allocationTimetablingOperations research To reference this document use: http://resolver.tudelft.nl/uuid:d2f7a3ec-d948-4a11-92de-d3de72e15ede TNO identifier 234661 ISSN 0377-2217 Source European Journal of Operational Research, 110 (3), 474-489 Document type article Files To receive the publication files, please send an e-mail request to TNO Library.