3 research outputs found

    Rail-freight crew scheduling with a genetic algorithm

    Get PDF
    peer reviewedThis article presents a novel genetic algorithm designed for the solution of the Crew Scheduling Problem (CSP) in the rail-freight industry. CSP is the task of assigning drivers to a sequence of train trips while ensuring that no driver’s schedule exceeds the permitted working hours, that each driver starts and finishes their day’s work at the same location, and that no train routes are left without a driver. Real-life CSPs are extremely complex due to the large number of trips, opportunities to use other means of transportation, and numerous government regulations and trade union agreements. CSP is usually modelled as a set-covering problem and solved with linear programming methods. However, the sheer volume of data makes the application of conventional techniques computationally expensive, while existing genetic algorithms often struggle to handle the large number of constraints. A genetic algorithm is presented that overcomes these challenges by using an indirect chromosome representation and decoding procedure. Experiments using real schedules on the UK national rail network show that the algorithm provides an effective solution within a faster timeframe than alternative approaches

    Bus driver rostering by hybrid methods based on column generation

    Get PDF
    Tese de doutoramento, Informática (Engenharia Informática), Universidade de Lisboa, Faculdade de Ciências, 2018Rostering problems arise in a diversity of areas where, according to the business and labor rules, distinct variants of the problem are obtained with different constraints and objectives considered. The diversity of existing rostering problems, allied with their complexity, justifies the activity of the research community addressing them. The current research on rostering problems is mainly devoted to achieving near-optimal solutions since, most of the times, the time needed to obtain optimal solutions is very high. In this thesis, a Bus Driver Rostering Problem is addressed, to which an integer programming model is adapted from the literature, and a new decomposition model with three distinct subproblems representations is proposed. The main objective of this research is to develop and evaluate a new approach to obtain solutions to the problem in study. The new approach follows the concept of search based on column generation, which consists in using the column generation method to solve problems represented by decomposition models and, after, applying metaheuristics to search for the best combination of subproblem solutions that, when combined, result in a feasible integer solution to the complete problem. Besides the new decomposition models proposed for the Bus Driver Rostering Problem, this thesis proposes the extension of the concept of search by column generation to allow using population-based metaheuristics and presents the implementation of the first metaheuristic using populations, based on the extension, which is an evolutionary algorithm. There are two additional contributions of this thesis. The first is an heuristic allowing to obtain solutions for the subproblems in an individual or aggregated way and the second is a repair operator which can be used by the metaheuristics to repair infeasible solutions and, eventually, generate missing subproblem solutions needed. The thesis includes the description and results from an extensive set of computational tests. Multiple configurations of the column generation with three decomposition models are tested to assess the best configuration to use in the generation of the search space for the metaheuristic. Additional tests compare distinct single-solution metaheuristics and our basic evolutionary algorithm in the search for integer solutions in the search space obtained by the column generation. A final set of tests compares the results of our final algorithm (with the best column generation configuration and the evolutionary algorithm using the repair operator) and the solutions obtained by solving the problem represented by the integer programming model with a commercial solver.Programa de Apoio à Formação Avançada de Docentes do Ensino Superior Politécnico (PROTEC), SFRH/PROTEC/67405/201

    Evolutionary algorithms for scheduling operations

    Get PDF
    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
    corecore