Improving performance and the reliability of off-site pre-cast concrete production operations using simulation optimisation

The increased use of precast components in building and heavy civil engineering projects has led to the introduction of innovative management and scheduling systems to meet the demand for increased reliability, efficiency and cost reduction. The aim of this study is to develop an innovative crew allocation system that can efficiently allocate crews of workers to labour-intensive repetitive processes. The objective is to improve off-site pre-cast production operations using Multi-Layered Genetic Algorithms. The Multi-Layered concept emerged in response to the modelling requirements of different sets of labour inputs. As part of the techniques used in developing the Crew Allocation “SIM_Crew” System, a process mapping methodology is used to model the processes of precast concrete operations and to provide the framework and input required for simulation. Process simulation is then used to model and imitate all production processes, and Genetic Algorithms are embedded within the simulation model to provide a rapid and intelligent search. A Multi-Layered chromosome is used to store different sets of inputs such as crews working on different shifts and process priorities. A ‘Class Interval’ selection strategy is developed to improve the chance of selecting the most promising chromosomes for further investigation. Multi-Layered Dynamic crossover and mutation operators are developed to increase the randomness of the searching mechanism for solutions in the solution space. The results illustrate that adopting different combinations of crews of workers has a substantial impact on the labour allocation cost and this should lead to increased efficiency and lower production cost. In addition, the results of the simulation show that minimum throughput time, minimum process-waiting time and optimal resource utilisation profiles can be achieved when compared to a real-life case study

A study of genetic operators for the Workforce Scheduling and Routing Problem

The Workforce Scheduling and Routing Problem (WSRP) is concerned with planning visits of qualified workers to different locations to perform a set of tasks, while satisfying each task time-window plus additional requirements such as customer/workers preferences. This type of mobile workforce scheduling problem arises in many real-world operational scenarios. We investigate a set of genetic operators including problem-specific and well-known generic operators used in related problems. The aim is to conduct an in-depth analysis on their performance on this very constrained scheduling problem. In particular, we want to identify genetic operators that could help to minimise the violation of customer/workers preferences. We also develop two cost-based genetic operators tailored to the WSRP. A Steady State Genetic Algorithm (SSGA) is used in the study and experiments are conducted on a set of problem instances from a real-world Home Health Care scenario (HHC). The experimental analysis allows us to better understand how we can more effectively employ genetic operators to tackle WSRPs

A Memetic Algorithm for a Bi-objective Bus Driver Rostering Problem

The Bus Driver Rostering Problem (DRP) consists of assigning bus drivers to daily duties during a planning period. The problem considers hard constraints imposed by institutional and legal requirements. Solutions should as much as possible satisfy soft constraints that qualify rosters according to either the company's or the drivers' interests. A bi-objective version of the DRP is considered and two models are presented. Due to the high computational complexity of DRP, this paper proposes the Strength Pareto Utopic Memetic Algorithm (SPUMA) a new heuristic algorithm specially devised to tackle the problem. SPUMA genetic component combines utopic elitism with a strength Pareto fitness evaluation and includes an improvement procedure. Computational results show that SPUMA outperforms an adaptation of one of the state-of-the-art most competitive multi-objective evolutionary algorithms, SPEA2

Disruption Management of Rolling Stock in Passenger Railway Transportation

This paper deals with real-time disruption management of rolling stock in passenger railway transportation. We present a generic framework for modeling disruptions in railway rolling stock schedules. The framework is presented as an online combinatorial decision problem where the uncertainty of a disruption is modeled by a sequence of information updates. To decompose the problem we propose a rolling horizon approach where only rolling stock decisions within a certain time horizon from the time of rescheduling are taken into account. The schedules are then revised as the situation progresses and more accurate information becomes available. We extend an existing model for rolling stock scheduling to the specific requirements of the real-time case and apply it in the rolling horizon framework. We perform computational tests on instances constructed from real life cases and explore the consequences of different settings of the approach for the trade-off between solution quality and computation time