Abstract
AbstractRailroad job clustering is an important part of railroad track maintenance planning. It focuses on clustering track maintenance jobs into projects, so that the projects can be assigned to the production teams and scheduled in the planning horizon. The real‐world instances of job‐clustering problem usually have a very large scale, involving thousands of jobs per year. Various difficult side constraints such as mutual exclusion constraints and rounding constraints further increase the difficulty in solving the problem. In this article, we develop a mixed‐integer mathematical programming model in the form of vehicle routing problem with side constraints, and propose a set of integrated heuristic algorithms to solve the problem. The proposed model and algorithms are shown to be effective and have been adopted by a Class‐I railroad to help their practical operations for a few years.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Computer-Aided Civil and Infrastructure Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
