A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards
نویسندگان
چکیده
This article presents a novel matheuristic for solving the hump yard block-to-track assignment problem. This is an important problem arising in the railway freight industry and involves scheduling the transitions of a set of rail cars from a set of inbound trains to a set of outbound trains over a certain planning horizon. It was also the topic of the 2014 challenge organized by the Railway Applications Section of the Institute for Operations Research and the Management Sciences for which the proposed matheuristic was awarded first prize. Our approach decomposes the problem into three highly dependent subproblems. Optimization-based strategies are adopted for two of these, while the third is solved using a greedy heuristic. We demonstrate the efficiency of the complete framework on the official datasets, where solutions within 4–14% of a known lower bound (to a relaxed problem) are found. We further show that improvements of around 8% can be achieved if outbound trains are allowed to be delayed by up to 2 h in the hope of ensuring an earlier connection for some of the rail cars. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 67(2), 126–138 2016
منابع مشابه
A Matheuristic Approach for Solving the Railroad Hump Yard Block-to-Track Assignment
This paper presents a novel matheuristic for solving the Hump Yard Block-to-Track Assignment Problem. This is an important problem rising in the railway freight industry and involves scheduling the transitions of a set of rail cars from a set of inbound trains to a set of outbound trains over a certain planning horizon. It was also the topic of the 2014 challenge organised by the Railway Applic...
متن کاملA Multi-objective Ant Colony Optimization Method Applied to Switch Engine Scheduling in Railroad Yards
This paper proposes an ant colony optimization algorithm to assist railroad yard operational planning staff in their daily tasks. The proposed algorithm tries to minimize a multi-objective function that considers both fixed and variable transportation costs involved in moving railroad cars within the railroad yard area. This is accomplished by searching the best switch engine schedule for a giv...
متن کاملOptimal Freight Train Classification using Column Generation
We consider planning of freight train classification at hump yards using integer programming. The problem involves the formation of departing freight trains from arriving trains subject to scheduling and capacity constraints. To increase yard capacity, we allow the temporary storage of early freight cars on specific mixed-usage tracks. The problem has previously been modeled using a direct inte...
متن کاملHump Yard Track Allocation with Temporary Car Storage∗
In rail freight operation, freight cars need to be separated and reformed into new trains at hump yards. The classification procedure is complex and hump yards constitute bottlenecks in the rail freight network, often causing outbound trains to be delayed. One of the problems is that planning for the allocation of tracks at hump yards is difficult, given that the planner has limited resources (...
متن کاملSingle-machine scheduling with stepwise tardiness costs and release times
We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 67 شماره
صفحات -
تاریخ انتشار 2016