Solving Practical Railway Crew Scheduling Problems with Attendance Rates

Arising from a practical problem in German rail passenger transport, a prototype for a multi-period railway crew scheduling problem with attendance rates for conductors is developed and evaluated in this paper. The consideration of attendance rates is of increasing importance in regional transport networks and requires decision support. For this purpose business analytics is applied in order to offer an approach to transform real-world data to concrete operational decision support (action). The focus here is on the analysis step using a new set covering model with several essential restrictions integrated for the first time. A hybrid column generation approach is applied, which solves the pricing problem by means of a genetic algorithm. The artifact is evaluated with the help of a case study of three real-world transport networks. It is shown that the hybrid solution approach is able to solve the problem more effectively and efficiently compared to conventional approaches used in practice

Modeling and Solving of Railway Optimization Problems

The main aim of this work is to provide decision makers suitable approaches for solving two crucial planning problems in the railway industry: the locomotive assignment problem and the crew scheduling problem with attendance rates. On the one hand, the focus is on practical usability and the necessary integration and consideration of real-life requirements in the planning process. On the other hand, solution approaches are to be developed, which can provide solutions of sufficiently good quality within a reasonable time by taking all these requirements into account

Applications of Genetic Algorithm and Its Variants in Rail Vehicle Systems: A Bibliometric Analysis and Comprehensive Review

Railway systems are time-varying and complex systems with nonlinear behaviors that require effective optimization techniques to achieve optimal performance. Evolutionary algorithms methods have emerged as a popular optimization technique in recent years due to their ability to handle complex, multi-objective issues of such systems. In this context, genetic algorithm (GA) as one of the powerful optimization techniques has been extensively used in the railway sector, and applied to various problems such as scheduling, routing, forecasting, design, maintenance, and allocation. This paper presents a review of the applications of GAs and their variants in the railway domain together with bibliometric analysis. The paper covers highly cited and recent studies that have employed GAs in the railway sector and discuss the challenges and opportunities of using GAs in railway optimization problems. Meanwhile, the most popular hybrid GAs as the combination of GA and other evolutionary algorithms methods such as particle swarm optimization (PSO), ant colony optimization (ACO), neural network (NN), fuzzy-logic control, etc with their dedicated application in the railway domain are discussed too. More than 250 publications are listed and classified to provide a comprehensive analysis and road map for experts and researchers in the field helping them to identify research gaps and opportunities

A Lagrangian Relaxation Approach Based on a Time-Space-State Network for Railway Crew Scheduling

The crew scheduling problem is an important and difficult problem in railway crew management. In this paper, we focus on the railway crew scheduling problem with time window constraints caused by meal break rules. To solve this optimization problem, a solution method is proposed based on a time-space-state network and Lagrangian relaxation. In this method, the "hard constraints" corresponding to the crew rules are described as the state of vertices in the time-space-state network. Based on the network, this problem is modeled as a network flow model, referred to as an initial model. To break the symmetry and improve the strength of the formulation, five valid inequalities are added. To solve the problem, we relax the coupling constraints by Lagrangian relaxation. The resulting subproblems are shortest path problems in the time-space-state networks. We propose a Lagrangian heuristic to find a feasible solution. Finally, the solution method is tested on real-world instances from an intercity rail line and a regional railway network in China. We discuss the effects of additional valid inequalities and the effects of different length of meal time windows

Integrated and Dynamic Vehicle and Crew Scheduling

Due to increased competition in the public transport market and the pressure on governments to cut expenses, increasing attention has been paid to cost reductions in public transportation. Since the main resources used in public transportation are vehicles and crews, producing efficient vehicle and crew schedules is an important issue. A sequential approach, i.e. vehicle scheduling followed by crew scheduling, does not guarantee an overall optimal solution. Therefore, integrated approaches are considered in this thesis. For different cases, mathematical model

Evolutionary algorithms for scheduling operations

While business process automation is proliferating through industries and processes, operations such as job and crew scheduling are still performed manually in the majority of workplaces. The linear programming techniques are not capable of automated production of a job or crew schedule within a reasonable computation time due to the massive sizes of real-life scheduling problems. For this reason, AI solutions are becoming increasingly popular, specifically Evolutionary Algorithms (EAs). However, there are three key limitations of previous studies researching application of EAs for the solution of the scheduling problems. First of all, there is no justification for the selection of a particular genetic operator and conclusion about their effectiveness. Secondly, the practical efficiency of such algorithms is unknown due to the lack of comparison with manually produced schedules. Finally, the implications of real-life implementation of the algorithm are rarely considered. This research aims at addressing all three limitations. Collaborations with DBSchenker,the rail freight carrier, and Garnett-Dickinson, the printing company,have been established. Multi-disciplinary research methods including document analysis, focus group evaluations, and interviews with managers from different levels have been carried out. A standard EA has been enhanced with developed within research intelligent operators to efficiently solve the problems. Assessment of the developed algorithm in the context of real life crew scheduling problem showed that the automated schedule outperformed the manual one by 3.7% in terms of its operating efficiency. In addition, the automatically produced schedule required less staff to complete all the jobs and might provide an additional revenue opportunity of £500 000. The research has also revealed a positive attitude expressed by the operational and IT managers towards the developed system. Investment analysis demonstrated a 41% return rate on investment in the automated scheduling system, while the strategic analysis suggests that this system can enable attainment of strategic priorities. The end users of the system, on the other hand, expressed some degree of scepticism and would prefer manual methods

DECISION SUPPORT MODEL IN FAILURE-BASED COMPUTERIZED MAINTENANCE MANAGEMENT SYSTEM FOR SMALL AND MEDIUM INDUSTRIES

Maintenance decision support system is crucial to ensure maintainability and reliability of equipments in production lines. This thesis investigates a few decision support models to aid maintenance management activities in small and medium industries. In order to improve the reliability of resources in production lines, this study introduces a conceptual framework to be used in failure-based maintenance. Maintenance strategies are identified using the Decision-Making Grid model, based on two important factors, including the machines’ downtimes and their frequency of failures. The machines are categorized into three downtime criterions and frequency of failures, which are high, medium and low. This research derived a formula based on maintenance cost, to re-position the machines prior to Decision-Making Grid analysis. Subsequently, the formula on clustering analysis in the Decision-Making Grid model is improved to solve multiple-criteria problem. This research work also introduced a formula to estimate contractor’s response and repair time. The estimates are used as input parameters in the Analytical Hierarchy Process model. The decisions were synthesized using models based on the contractors’ technical skills such as experience in maintenance, skill to diagnose machines and ability to take prompt action during troubleshooting activities. Another important criteria considered in the Analytical Hierarchy Process is the business principles of the contractors, which includes the maintenance quality, tools, equipments and enthusiasm in problem-solving. The raw data collected through observation, interviews and surveys in the case studies to understand some risk factors in small and medium food processing industries. The risk factors are analysed with the Ishikawa Fishbone diagram to reveal delay time in machinery maintenance. The experimental studies are conducted using maintenance records in food processing industries. The Decision Making Grid model can detect the top ten worst production machines on the production lines. The Analytical Hierarchy Process model is used to rank the contractors and their best maintenance practice. This research recommends displaying the results on the production’s indicator boards and implements the strategies on the production shop floor. The proposed models can be used by decision makers to identify maintenance strategies and enhance competitiveness among contractors in failure-based maintenance. The models can be programmed as decision support sub-procedures in computerized maintenance management systems