A Lagrangian heuristic for a train-unit assignment problem
Reads0
Chats0
TLDR
A fast heuristic is presented for an important NP-hard problem, arising in the planning of a railway passenger system, that calls for the definition of the train units to be assigned to a given set of timetabled trips, each with a given number of passenger seats requested.About:
This article is published in Discrete Applied Mathematics.The article was published on 2013-08-01 and is currently open access. It has received 41 citations till now. The article focuses on the topics: Generalized assignment problem & Lagrangian relaxation.read more
Citations
More filters
Posted Content
Efficient Circulation of Railway Rolling Stock
TL;DR: This paper presents aninteger programming approach to solve the circulation of train units on a single line and applies this approach to a real life case study based on the 2001-2002 timetable of NS Reizigers, the major Dutch operator of passenger trains.
Journal ArticleDOI
Collaborative optimization for metro train scheduling and train connections combined with passenger flow control strategy
TL;DR: Under the proposed collaborative optimization approach, the number of train service connections and the crowding inside stations and carriages with the proper passenger flow control strategy can be evidently balanced, and thereby the operation efficiency and safety of the metro lines are effectively improved.
Journal ArticleDOI
Rolling stock scheduling with maintenance requirements at the Chinese High-Speed Railway
Qingwei Zhong,Qingwei Zhong,Richard Martin Lusby,Jesper Larsen,Yongxiang Zhang,Yongxiang Zhang,Qiyuan Peng +6 more
TL;DR: Comparisons with the manual approach that is currently used in practice show that the proposed heuristic approach yields far superior schedules, which improve rolling stock efficiency and lead to a reduction in operating cost of approximately 10.5%.
Journal ArticleDOI
Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking
TL;DR: A variable-splitting approach is adopted to introduce task-specific and vehicle-distinguishable Lagrangian multipliers and then a sequential assignment process is proposed in order to enhance the solution quality for the augmented models with tight formulations.
Journal ArticleDOI
Integrated optimization of regular train schedule and train circulation plan for urban rail transit lines
TL;DR: Wang et al. as mentioned in this paper presented an integrated model to optimize the train schedule and circulation plan simultaneously based on a given service pattern generated by the demand analysis and line planning, where the operation of train services, the turnaround operations, the entering/exiting depot operation and the number of available trains are involved in the model.
References
More filters
Journal ArticleDOI
The Traveling-Salesman Problem and Minimum Spanning Trees
Michael Held,Richard M. Karp +1 more
TL;DR: It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers.
Journal ArticleDOI
The traveling-salesman problem and minimum spanning trees: Part II
Michael Held,Richard M. Karp +1 more
TL;DR: An efficient iterative method for approximating this bound closely from below is presented, and a branch-and-bound procedure based upon these considerations has easily produced proven optimum solutions to all traveling-salesman problems presented to it.
Book ChapterDOI
Passenger Railway Optimization
TL;DR: This chapter discusses the European situation, where the major part of railway transportation consists of passenger transportation without addressing important problems in cargo transportation—such as car blocking, train makeup, train routing, and empty car distribution.
A rolling stock circulation model for combining and splitting of passenger trains.
TL;DR: In this paper, the authors address the railway rolling stock circulation problem and propose an extension of an existing rolling stock model for routing train units along a number of connected train lines, which can also handle underway combining and splitting of trains.
A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
TL;DR: In this paper, a decomposition method for the simultaneous assignment of locomotives and cars in the context of passenger transportation is presented, where the problem is to determine a set of minimum cost equipment cycles such that every leg is covered using appropriate equipment.