نتایج جستجو برای: crew scheduling
تعداد نتایج: 72925 فیلتر نتایج به سال:
This paper describes a method for solving the cyclic crew rostering problem (CCRP). This is the problem of cyclically ordering a set of duties for a number of crew members, such that several complex constraints are satisfied and such that the quality of the obtained roster is as high as possible. The described method was tested on a number of instances of NS, the largest operator of passenger t...
In the fractional ownership model, the partial owner of an aircraft is entitled to certain flight hours per year, and the management company is responsible for all the operational considerations of the aircraft and for making an aircraft available to the owner at the requested time and place. In the recent years although the industry as a whole has experienced significant growth, most of the ma...
An effective maintenance manpower supply plan not only reduces operating costs but ensures greater aviation safety and punctuality. A variety of flexible management strategies have been widely applied in other industries; however, little research has stressed flexible management strategies for airline crew scheduling problems. Here, we introduce a model that includes various flexible strategies...
Airline crew rostering is an important part of airline operations and an interesting problem for the application of operations research. The objective is to assign anonymous crew pairings either to personalized rosters or to anonymous bidlines which subsequently will be assigned to individual crew members. Compared to the crew pairing problem, crew rostering has received much less attention in ...
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP). The algorithm was initially designed for solving very large scale SCP instances, involving up to 5,000 rows and 1,000,000 columns, arising from crew scheduling in the Italian Railway Company, Ferrovie dello Stato SpA. In 1994 Ferrovie dello Stato SpA, jointly with the Italian Operational Research Society, org...
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
This paper addresses the Ground Crew Rostering Problem with Work Patterns, an important manpower planning problem arising in the ground operations of airline companies. We present a cutting stockbased integer programming formulation of the problem and describe a powerful heuristic decomposition approach, which utilizes column generation and variable fixing, to construct efficient rosters for a ...
Real life applications involve entities and algorithms that are complex to model and implement. Logic programming, the most practical approach of logic, facilitates the development procedure for these applications. However, its declarativeness does not seem suucient to provide the means for the implementation of fully usable systems. In this paper, we discuss the applicability of logic programm...
The fleet assignment problem (FAP) deals with assigning aircraft types, each having a different capacity, to the scheduled flights, based on equipment capabilities and availabilities, operational costs, and potential revenues. An airline s fleeting decision highly impacts its revenues, and thus, constitutes an essential component of its overall scheduling process. However, due to the large numb...
A novel method is presented and explored within the framework of Potts neural networks for solving optimization problems with a non-trivial topology, with the airline crew scheduling problem as a target application. The key ingredient to handle the topological complications is a propagator defined in terms of Potts neurons. The approach is tested on artificial problems generated with two real-w...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید