concurrent locomotive assignment and freight train scheduling

Publish Year: 1395
نوع سند: مقاله ژورنالی
زبان: English
View: 523

This Paper With 15 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_IJIEPR-27-4_002

تاریخ نمایه سازی: 2 آبان 1396

Abstract:

The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotive coupling delay all freight rakes are hauled to their destinations. Scheduling freight trains consists of sequencing and ordering freight trains during the non-usage time between passenger trains but with no interference and with minimum delay times. Solving these two problems simultaneously is of high importance and can be highly effective in decreasing costs for rail transportation. In this paper, we aim to minimize the operational costs for the locomotive assignment and the freight train scheduling by solving these two problems concurrently. To meet this objective, an efficient and effective algorithm based on the ant colony system is proposed. To evaluate the performance of the proposed solution method, twenty-five test problems, which are based on the conditions of Iran Railways, are solved and the computational results are reported

Authors

masoud yaghini

Department of Rail Transportation Engineering, Iran University of Science and Technology

faeze ghofrani

Department of Rail Transportation Engineering, Iran University of Science and Technology

mohammad karimi

Department of Rail Transportation Engineering, Iran University of Science and Technology

majedeh esmi zadeh

Department of Rail Transportation Engineering, Iran University of Science and Technology