Models and algorithms for Integration of Vehicle and Crew Scheduling

This paper deals with models, relaxations and algorithms for an integrated approach to vehicle and crew scheduling. We discuss potential benefits of integration and provide an overview of the literature, which considers mainly partial integration. Our approach is new in the sense that we can tackle integrated vehicle and crew scheduling problems of practical size.We propose new mathematical formulations for integrated vehicle and crew scheduling problems and we discuss corresponding Langrangian relaxations and Lagrangian heuristics. To solve the Lagrangian relaxations, we use column generation applied to set partitioning type of models. The paper is concluded with a computational study using real life data, which shows the applicability of the proposed techniques to practical problems. Furthermore, we also address the effectiveness of integration in different situations.Lagrangian relaxation;column generation;crew scheduling;integrated planning;vehicle scheduling

A dynamic approach to vehicle scheduling

This paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our dynamic approach, we solve a sequence of optimization problems, where we take into account different scenarios for future travel times. Because in the multiple-depot case we cannot solve the problem exactly within reasonable computation time, we use a "cluster-reschedule" heuristic where we first assign trips to depots by solving the static problem and then solve dynamic single-depot problems. We use new mathematical formulations of these problems that allow a fast solution by standard optimization software. We report on the results of a computational study with real life data, in which we compare different variants of our approach and perform a sensitivity analysis with respect to deviations of the actual travel times from the estimated ones.vehicle scheduling;dynamic scheduling;public transport;stochastic programming;stochastic traveltimes

Applying an Integrated Approach to Vehicle and Crew Scheduling in Practice

This paper deals with a practical application of an integrated approach to vehicle and crew scheduling, that we have developed previously. Computational results have shown that our approach can be applied to problems of practical size. However, application of the approach to the actual problems that one encounters in practice, is not always straightforward. This is mainly due to the existence of particular constraints that can be regarded as \\house rules" of the public transport company under consideration. In this paper we apply our approach to problems of individual bus lines of the RET, the Rotterdam public transport company, where particular constraints should be satisfied. Furthermore, we investigate the impact of allowing drivers to change vehicle during a break. Currently, the rule at the RET is that such changeovers are only allowed in split duties; they are never allowed in other type of duties. We show that it is already possible to save crews if for the non-split duties, restricted changeovers are allowed.Lagrangian relaxation;column generation;crew scheduling;integrated planning;vehicle scheduling

Stochastic programming for multiple-leg network revenue management

Airline seat inventory control is a very profitable tool in the airline industry. Mathematical programming models provide booking limits or bid-prices for all itineraries and fare classes based on demand forecasts. But the actual revenue generated in the booking process fails to meet expectations. Simple deterministic models based on expected demand generate better revenue than more advanced probabilistic models. Recently suggested models put even more effort into demand forecasting. We will show that the dynamic booking process rather than the demand forecasts needs to be addressed. In particular the nesting strategies applied in booking control will counter-effect the profitability of advanced estimation of booking limits and bid-prices.simulation;revenue management;mathematical programming

Models and techniques for hotel revenue management using a rolling horizon.

This paper studies decision rules for accepting reservations for stays in a hotel based on deterministic and stochastic mathematical programming techniques. Booking control strategies are constructed that include ideas for nesting, booking limits and bid prices. We allow for multiple day stays. Instead of optimizing a decision period consisting of a fixed set of target booking days, we simultaneously optimize the complete range of target booking dates that are open for booking at the moment of optimization. This yields a rolling horizon of overlapping decision periods, which will conveniently capture the effects of overlapping stays.Revenue management;Mathematical programming;Yield management

Models and Techniques for Hotel Revenue Management Using a Roling Horizon

AbstractThis paper studies decision rules for accepting reservations for stays in a hotel based on deterministic and stochastic mathematical programming techniques. Booking control strategies are constructed that include ideas for nesting, booking limits and bid prices. We allow for multiple day stays. Instead of optimizing a decision period consisting of a fixed set of target booking days, we simultaneously optimize the complete range of target booking dates that are open for booking at the moment of optimization. This yields a rolling horizon of overlapping decision periods, which will conveniently capture the effects of overlapping stays.mathematical programming;Revenue Management;yield management

Communication Network Among Campus Sustainability Influencers

Systems of all types require efficient communication between its parts and units in order to be successful and e ective. It is thus important to understand a systems units in order to better advance its operations. In this study, we look at Loyola Marymount University (LMU) as a systematic organization in regards to the universitys execution of its environmental sustainability endeavors. This approach allows for the identification of the path by which important environmental sustainability information is communicated, is learned, and is acted upon at LMU. Through various network centrality measurements, I will develop a visual representation of the communication network between individuals on LMU\u27s campus who have an interest and play a role in the development and advancement of environmental sustainability practices and policies on campus. Moreover, an analytical understanding of this network of information transference will provide insight into the decision-making, implementation, and management that affects the e orts to reduce LMU\u27s campus carbon footprint

Shunting of Passenger Train Units in a Railway Station

In this paper we introduce the problem of shunting passenger trainunits in a railway station. Shunting occurs whenever train units aretemporarily not necessary to operate a given timetable. We discussseveral aspects of this problem and focus on two subproblems. Wepropose mathematical models for these subproblems together with asolution method based on column generation. Furthermore, a newefficient and speedy solution technique for pricing problems in columngeneration algorithms is introduced. Finally, we present computationalresults based on real life instances from Netherlands Railways.logistics;column generation;railway optimization;real world application

MATE program: Erosion resistant compressor airfoil coating, volume 2

The performance of candidate erosion resistant airfoil coatings installed in ground tested experimental JT8D and JT9D engines and subjected to cyclic endurance at idle, takeoff and intermediate power conditions has been evaluated. Engine tests were terminated prior to the scheduled 1000 cycles of endurance test due to high cycle fatigue fracture of the Gator-Gard plasma sprayed 88WC-12Co coating on titanium alloy airfoils. Coated steel (AMS5616) and nickel base alloy (Incoloy 901) performed well in both engine tests. Post test airfoil analyses consisted of binocular, scanning electron microscope and metallographic examinations

Rostering at a Dutch Security Firm

The roster planning process at the Dutch security firm NVD was traditionally carried out by hand. A few years NVD was traditionally carried out by hand. A few years ago, because of changing labor laws in the Netherlands, this became practically impossible. We developed a decision support system which has four main modules. The first one checks given rosters for feasibility with respect to the complicated rules of the current Collective Labor Agreement. A second module generates feasible rosters. The third one evaluates each roster with respect to its cost and ergonomic criteria. Finally, the fourth module uses mathematical programming based methods to select high quality rosters. The DSS has received rave reviews from upper management, security employees as well as the planners, who have gained enormous insight into the planning process. The DSS is currently being implemented and will be operational within the near future.decision support systems;information systems;labor;applications;integer;programming;search and surveillance