Search results

The purpose of this paper is twofold: first to carry out a comprehensive literature review for state of the art regarding airline schedule planning and second to identify some new research directions that might help academic researchers and practitioners.

The authors mainly focus on the research work appeared in the last three decades. The search process was conducted in database searches using four keywords: “Flight scheduling,” “Fleet assignment,” “Aircraft maintenance routing” (AMR), and “Crew scheduling”. Moreover, the combination of the keywords was used to find the integrated models. Any duplications due to database variety and the articles that were written in non-English language were discarded.

The authors studied 106 research papers and categorized them into five categories. In addition, according to the model features, subcategories were further identified. Moreover, after discussing up-to-date research work, the authors suggested some future directions in order to contribute to the existing literature.

The presented categories and subcategories were based on the model characteristics rather than the model formulation and solution methodology that are commonly used in the literature. One advantage of this classification is that it might help scholars to deeply understand the main variation between the models. On the other hand, identifying future research opportunities should help academic researchers and practitioners to develop new models and improve the performance of the existing models.

This study proposed some considerations in order to enhance the efficiency of the schedule planning process practically, for example, using the dynamic Stackelberg game strategy for market competition in flight scheduling, considering re-fleeting mechanism under heterogeneous fleet for fleet assignment, and considering the stochastic departure and arrival times for AMR.

In the literature, all the review papers focused only on one category of the five categories. Then, this category was classified according to the model formulation and solution methodology. However, in this work, the authors attempted to propose a comprehensive review for all categories for the first time and develop new classifications for each category. The proposed classifications are hence novel and significant.

One of the main advantages of the proposed model is that it is flexible to generate n-day pairings simultaneously. It means that, despite previous researches, one-day to n-day pairings can be generated in a single model. The flexibility in generating parings causes that the proposed model leads to better solutions compared to existing models. Another advantage of the model is minimizing the risk of COVID-19 by limitation of daily flights as well as elapsed time minimization. As airports are among high risk places in COVID-19 pandemic, minimization of infection risk is considered in this model for the first time. Genetic algorithm is used as the solution approach, and its efficiency is compared to GAMS in small and medium-size problems.

One of the most complex issues in airlines is crew scheduling problem which is divided into two subproblems: crew pairing problem (CPP) and crew rostering problem (CRP). Generating crew pairings is a tremendous and exhausting task as millions of pairings may be generated for an airline. Moreover, crew cost has the largest share in total cost of airlines after fuel cost. As a result, crew scheduling with the aim of cost minimization is one of the most important issues in airlines. In this paper, a new bi-objective mixed integer programming model is proposed to generate pairings in such a way that deadhead cost, crew cost and the risk of COVID-19 are minimized.

The proposed model is applied for domestic flights of Iran Air airline. The results of the study indicate that genetic algorithm solutions have only 0.414 and 0.380 gap on average to optimum values of the first and the second objective functions, respectively. Due to the flexibility of the proposed model, it improves solutions resulted from existing models with fixed-duty pairings. Crew cost is decreased by 12.82, 24.72, 4.05 and 14.86% compared to one-duty to four-duty models. In detail, crew salary is improved by 12.85, 24.64, 4.07 and 14.91% and deadhead cost is decreased by 11.87, 26.98, 3.27, and 13.35% compared to one-duty to four-duty models, respectively.

The authors confirm that it is an original paper, has not been published elsewhere and is not currently under consideration of any other journal.

Information sharing is an important component of cooperation in supply chain management. However, it has long been debated whether there is value in information sharing, how large the value is, if any, and what factors affect it. The purpose of the paper lies in investigating these three issues by comparing and analyzing 12 information models in supply chains.

To achieve the above purpose, the paper first presents a general information‐sharing model in supply chains and characterizes three major factors in the model (objective, supply chain partnership constraint, information sharing constraint). Based on the general model, 12 representative models are selected from the literature and their relationship and distinctions are compared and analyzed.

By insights from comparative analysis of these representative models, the paper concludes that information sharing in supply chains is valuable. However, the value and affecting factors are dependent on analytical methods. It would be meaningless simply to compare the numerical values.

The framework developed in this paper provides a useful guidance for the practical managers in evaluating and measuring the value of information‐sharing strategies.

The paper critically reviews representative information‐sharing models in supply chains. This work is helpful in answering some questions that have been long debated in this area and in inspiring new endeavors to overcome the limitations of current research.

The purpose of this paper is to carry out a comprehensive review for state-of-the-art works in disruption risk management of express logistics mainly supported by air-transportation. The authors aim to suggest some new research directions and insights for express logistics practitioners to develop more robust planning in air-transportation.

The authors mainly confined the research to papers published over the last two decades. The search process was conducted in two dimensions: horizontal and vertical. In the horizontal dimension, attention was paid to the evolution of disruption management across the timeline. In the vertical dimension, different foci and strategies of disruption management are employed to distinguish each article. Three keywords were used in the full text query: “Disruption management”, “Air transportation”, and “Airline Operations” in all database searches listed above. Duplications due to database overlap, articles other than those from academic journals, and papers in languages other than English were discarded.

A total of 98 articles were studied. The authors categorized the papers into two broad categories: Reactive Recovery, and Proactive Planning. In addition, based on the problem characteristics and their application scenarios, a total of 11 sub-categories in reactive recovery and nine sub-categories in proactive planning were further identified. From the analysis, the authors identified some new categories in the air-transportation recovery. In addition, by analyzing the papers in robust planning, according to the problem characteristics and the state-of-the-art research in recovery problems, the authors proposed four new research directions to enhance the reliability and robustness of air-transportation express logistics.

This study provided a comprehensive and feasible taxonomy of disruption risk management. The classification scheme was based on the problem characteristics and the application scenarios, rather than the algorithms. One advantage of this scheme is that it enables an in-depth classification of the problem, that is, sub-categories of each class can be revealed, which provides a much wider and clearer horizon to the scientific progress in this area. This helps researchers to reveal the problem’s nature and to identify the future directions more systematically. The suggestions for future research directions also point out some critical research gaps and opportunities.

This study summarized various reasons which account for the disruption in air-transportation. In addition, the authors suggested various considerations for express logistics practitioners to enhance logistics network reliability and efficiency.

There are various classification schemes in the literature to categorize disruption management. Using different algorithms (e.g. exact algorithm, heuristics, meta-heuristics) and distinct characteristics of the problem elements (e.g. aircraft, crew, passengers, etc.) are the most common schemes in previous efforts to produce a disruption management classification scheme. However, the authors herein attempted to focus on the problem nature and the application perspective of disruption management. The classification scheme is hence novel and significant.

The purpose of this paper is to focus on disruption management responding to large‐area flight delays (LFD). It is urgent for airways to reschedule the disrupted flights so as to relieve the negative influence and minimize losses. The authors try to reduce the risk of airline company's credit and economic losses by rescheduling flights with mathematic models and algorithm.

Based on flight classifications of real‐time statuses and priority indicators, all flights are prioritized. In this paper, two mathematic programming models of flight rescheduling are proposed. For the second model, an optimum polynomial algorithm is designed.

In practice, when LFD happens, it is very important for the airline company to pay attention to real‐time statuses of all the flights. At the same time, the disruption management should consider not only the economic loss but also other non‐quantitative loss such as passengers' satisfaction, etc.

In this paper, two mathematic programming models of flight rescheduling are built. An algorithm is designed and it is proved to be an optimum polynomial algorithm and a case study is given to illustrate the algorithm. The paper provides a theory support for airways to reduce the risk brought by LFD.