Search

As the airline industry is ever expanding, companies are increasing their fleet sizes to obtain greater market shares. Moreover, as the airlines seek more growth, the complexity and size of the airline crew scheduling problem, which is one of the major planning problems in the industry, is also increasing. For this reason, companies dedicate resources to solve this problem, and lease software at great expense from external sources. Rigorous mathematical models and algorithms are used in solving these problems. This paper presents a survey of airline crew scheduling problems, and their proposed solutions from the literature. As a conclusion, prospective studies will be proposed and discussed with the aim of developing better solutions for airline crew scheduling problems in the future. [ABSTRACT FROM AUTHOR]

Abstract: Nonlinear model predictive control (NMPC) algorithms are based on various nonlinear models. A number of on-line optimization approaches for output-feedback NMPC based on various black-box models can be found in the literature. However, NMPC involving on-line optimization is computationally very demanding. On the other hand, an explicit solution to the NMPC problem would allow efficient on-line computations as well as verifiability of the implementation. This paper applies an approximate multi-parametric nonlinear programming approach to explicitly solve output-feedback NMPC problems for constrained nonlinear systems described by black-box models. In particular, neural network models are used and the optimal regulation problem is considered. A dual-mode control strategy is employed in order to achieve an offset-free closed-loop response in the presence of bounded disturbances and/or model errors. The approach is applied to design an explicit NMPC for regulation of a pH maintaining system. The verification of the NMPC controller performance is based on simulation experiments. [ABSTRACT FROM AUTHOR]

Abstract: In this paper a new iterative construction algorithm for local model networks is presented. The algorithm is focussed on building models with sparsely distributed data as they occur in engine optimization processes. The validity function of each local model is fitted to the available data using statistical criteria along with regularization and thus allowing an arbitrary orientation and extent in the input space. Local models are consecutively placed into those regions of the input space where the model error is still large thus guaranteeing maximal improvement through each new local model. The orientation and extent of each validity function are also adapted to the available training data such that the determination of the local regression parameters is a well-posed problem. The regularization of the model can be controlled in a distinct manner using only two user-defined parameters. In order to assess the quality of the obtained model, the algorithm also provides accurate model statistics. Different examples illustrate the efficiency of the proposed algorithm. One illustrative example shows how local models are adapted to the shape of the target function in the presence of noise. A second example shows results obtained with measurement databases of IC-engines. [Copyright &y& Elsevier]