A hybrid method to solve railroad passenger scheduling problem

Abstract

Railroad transportation planning is strategically a long term and an important decision making problem especially in the area of travelling passengers. There have been literally various methods to use in order to provide optimum traveling schedule such as direct or indirect methods. Direct solutions involve the implementation of mixed integer programming, which is often hard to solve for real-world applications. The proposed model of this paper uses a column generation method to decompose a large-scale railroad passenger-scheduling problem into some smaller scale problems, which are easier to solve. The primary concern with the resulted problem is that final solutions of the method need to be integer and this is in contrast with convexity assumption of column generation techniques. We propose heuristic method to handle this problem and apply the proposed model for some examples. The preliminary results indicate that the proposed model of this paper could provide optimal solutions for small-scale problems and it can reach some reasonable solutions for larger problems when direct implementation fails to do in reasonable amount of time.

Ranking of sequencing rules in a job shop scheduling problem with preference selection index approach

“…Scheduling problems were also studied in non-manufacturing areas. Yaghini et al (2012) introduced a model for decomposition of a bigger railroad traveller scheduling problem into minor range problems, which is simple to resolve and deliver finer traveling schedule. They have applied this concept on different bulks of stations in the range of 5-20.…”