A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases

Guo, Yufeng; Mellouli, Taïeb; Suhl, Leena; Thiel, Markus P.

doi:10.1016/j.ejor.2005.01.024

Cited by 34 publications

(14 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For instance, parameter ( ) 9 . 0 , 7 means that the satisfaction value from time 5 to 9 is approximately 7 and the possibility to finish sightseeing of place i in time 9 and move to a next sightseeing place after time 9 is 0.9.…”

Section: A Parameters In Our Proposed Model Letmentioning

confidence: 99%

“…, and hence, our proposed model is formulated as the following TEN-based tour planning problem (TEN-TPP) maximizing the total tourist satisfaction: (9) However, this problem is a fuzzy programming problem with fuzzy satisfaction values ( ) t t a ij ′ , and hence, we need to set some optimal criterion for the fuzzy objective function in order to solve this problem in mathematical programming problem. Thus, it is important for the tourist to maximize the total satisfaction values in tour planning for sightseeing as much as possible.…”

Section: Objective Function and Formulation Of Our Proposed Modelmentioning

confidence: 99%

“…Therefore, using the advantage, many researchers have considered applying the TEN to practical problems since the 1970s and 1980s [8,18]. In most recently, TEN-based models also have been proposed for various practical problems such as airline and crew scheduling [5,9,10], multi-depot bus scheduling [13], optimal capacity utilizations for intelligent transportation management of traffic coordination systems [14], car pooling problems [17], planning earth recycling and dump truck dispatching [4], etc.. In this paper, we focus on the modeling of personal tour planning considering several factors for times and satisfactions, and apply these advantages and usefulness of TEN to our proposed tour planning problem.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Route planning problem under fuzzy sightseeing times and satisfaction values of sightseeing places

Hasuike

Katagiri

Tsubaki³

et al. 2013

2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS)

View full text Add to dashboard Cite

This paper proposes a personal tour planning problem with uncertain traveling times and satisfaction values of sightseeing places dependent on sightseeing. Since traveling times are dependent on the time of day, it is difficult to represent this uncertain model using the general static network model. In this paper, Time-Expanded Network (TEN), which contains a copy to the set of nodes in the underlying static network for each discrete time step, is introduced. Using the proposed TEN-based model, it is possible to construct various variations of traveling times and satisfactions values of sightseeing places in a single static network. Furthermore, uncertain sightseeing times are represented as fuzzy variables and the proposed model is formulated as a fuzzy 0-1 mixed integer programming problem, and also equivalently transformed into several existing tour planning problems using some natural assumptions in fuzzy programming.

show abstract

Section: A Parameters In Our Proposed Model Letmentioning

confidence: 99%

Section: Objective Function and Formulation Of Our Proposed Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Route planning problem under fuzzy sightseeing times and satisfaction values of sightseeing places

Hasuike

Katagiri

Tsubaki³

et al. 2013

2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS)

View full text Add to dashboard Cite

show abstract

“…These problems are commonly categorized into flight scheduling design, fleet assignment, aircraft maintenance routing and crew scheduling (Dawid et al, 2001). In these problems, crew scheduling problems are well-known as one of the most difficult problems in the airlines (Guo et al, 2006). There are commonly two phases in the airline crew scheduling problems: the crew pairing problems and the crew rostering problems.…”

mentioning

confidence: 99%

“…The upper bound is improved by a metaheuristic algorithm. The effectiveness of the proposed method for a large scale rostering problem is shown from computational experiments.Application of two-phase decomposition algorithm to practical airline crew rostering problem for fair working time cost (Moudani et al, 2001;Maenhout and Vanhoucke, 2010), minimizing the most important cost (Guo et al, 2006), maximizing the utility of the rosters (Dawid et al, 2001), and the main objective is to minimize the operational cost and the second objective is to minimize the deviation of the working time (Souai and Teghem, 2009). Few works consider the crew satisfaction as an objective function.…”

mentioning

confidence: 99%

Application of two-phase decomposition algorithm to practical airline crew rostering problem for fair working time

Doi

Nishi

2016

JAMDSM

View full text Add to dashboard Cite

IntroductionAutomating cost-efficient scheduling in the airlines is getting more and more significant in recent years. As new low cost carriers come to appear, it is highly required for traditional full service carriers to reduce the operational costs. In the airlines, there are many types of scheduling problems in order to operate their flights. These problems are commonly categorized into flight scheduling design, fleet assignment, aircraft maintenance routing and crew scheduling (Dawid et al., 2001). In these problems, crew scheduling problems are well-known as one of the most difficult problems in the airlines (Guo et al., 2006). There are commonly two phases in the airline crew scheduling problems: the crew pairing problems and the crew rostering problems. In the crew pairing problems, a crew pairing that is a sequence of flight duties is allocated. Pairings are generated such that all of the duties are covered by the least number of pairings. The pairing also originates and terminates at the crew base. In the crew rostering problems, each pairing, holidays and reserved duties are assigned to each crew member satisfying all hard constraints such as rest days, rules and regulations. The reserved duties are trainings, medical appointments and so on. In this paper, we study a static crew rostering problem when the set of crew pairings is given in advance. It is hard to solve the crew rostering problems due to a large number of hard constraints. However, it is still important to obtain a better schedule because the quality of the solution has a direct impact on the operational costs in the airline industry.The constraints of the airline crew rostering problems differ for each airline company or each case study. For instance, there are consecutive flight days constraints (Gamache et al., 1998), rest days constraints (Souai and Teghem, 2009), total working time constraints (Moudani et al., 2001;Souai and Teghem, 2009). The problem in this paper additionally considers the practical constraints on consecutive rest days after an international flight, prohibition of assignment of crew members with the same group to the same duty. Most of the conventional studies do not emphasize on these practical constraints. The objective function of the problem also differs for each case. For instance, minimizing the operational 1 Tsubasa DOI * and Tatsushi NISHI * * Graduate School of Engineering Science, Osaka University 1-3 Machikaneyama-cho, Toyonaka city 560-8531, Japan E-mail: nishi@sys.es.osaka-u.ac.jp Received 15 November 2015 AbstractWe propose an application of a two-phase decomposition algorithm for a practical airline crew rostering problem for fair working time. The problem is to find an optimal assignment of duties to individual crew members such that various hard constraints such as rest days, rules and regulations are satisfied. The objective is to minimize the total deviation of the average working time from the standard working time for crew members. A two-phase decomposition algorithm is successfully applied to ...

show abstract

Operations Research (OR) in Service Industries: A Comprehensive Review

Xing

et al. 2013

Syst. Res.

View full text Add to dashboard Cite

The share of gross domestic product from the service industry reflects the competitiveness of a nation; the service industry in the USA accounts for around 80% of its gross domestic product, and it has been increasing gradually. Continual innovations and advances in enabling technologies for the service industry are crucial for developed countries to sustain their leading positions in the globalized economy. To clarify future research directions of operations research (OR) in the service industry, the state of art of OR has been examined systematically, the new requirements of OR are identified for its applications in service industries in comparison with those in manufacturing industries, and the limitations of existing methodologies and tools have been discussed. This paper was intended to provide an updated review on how OR has been applied in the service sector in recent years and what directions the study of OR will be carried forward in the near future. Under a proposed research framework, recent OR-related articles were collected from 17 leading OR journals and classified into the five most active sectors, that is, transportation and warehousing, information and communication, human health and social assistance, retails and wholesales, and financial and insurance services. The conclusions on the limitations of existing studies and the demanding ORs in the service have been drawn from our summaries and observations from a comprehensive review in this field.

show abstract

A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases

Cited by 34 publications

References 15 publications

Route planning problem under fuzzy sightseeing times and satisfaction values of sightseeing places

Route planning problem under fuzzy sightseeing times and satisfaction values of sightseeing places

Application of two-phase decomposition algorithm to practical airline crew rostering problem for fair working time

Operations Research (OR) in Service Industries: A Comprehensive Review

Contact Info

Product

Resources

About