1 - 6 of 6 articles
This paper proposes a comprehensive multi-level framework for railway scheduling, which starts with a high-level commercial description of intended train services and aims to generates a conflict-free detailed schedule as the final outcome. The approach consists of three description levels and...
The railway crew scheduling problem is to determine an optimal crew assignment for the railway timetable data by minimizing the required number of crew members in order to satisfy the set covering constraints. Column generation is one of the optimization methods that can solve the problem...
We discuss the airline crew pairing optimization problem and present a solution method based on a combination of column and cut generation. The generated cuts are a subclass of subset-row inequalities. The pricing subproblem is solved by a label-setting algorithm with a new backtracking scheme...
This paper proposes a new method for public transport (PT) network optimization that considers the entire PT chain from door-to-door and allows flexible line alignments. The approach optimizes different speed levels, e.g., bus and tram, regional train, etc., sequentially, starting with the...
Feeder transit services perform the crucial first/last mile access to transit by connecting people within a residential area to a major transit network. In this paper, we address the optimal zone design problem faced by planners for feeder transit services with high demands and long length of...
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.