A two stage heuristic algorithm for the integrated aircraft and crew schedule recovery problems

Airline disruptions incurred huge cost for airlines and serious inconvenience for travelers. In this paper, we study the integrated aircraft and crew schedule recovery problem. A two stage heuristic algorithm for the integrated recovery problem is proposed. In the first stage, the integrated aircraft recovery and flight-rescheduling model with partial crew consideration is built. This model is based on the traditional multi-commodity network model for the aircraft schedule recovery problem. The objective of this model also includes minimization of the original crew connection disruption. In the second stage, the integrated crew schedule recovery and flight re-scheduling model with partial aircraft consideration is built. We proposed a new multi-commodity model for the crew schedule recovery. The main advantage of such model is that it is much more efficient to integrate the flight-scheduling and aircraft consideration. New constraints are incorporated to guarantee that the aircraft connections generated in the stage 1 are still feasible. Two stages are run iteratively until no improvement can be achieved. Experimental results show that our method can provide better recovery solutions compared with the benchmark algorithms.     

Optimal filtering and control for wireless networked closed-loop control systems

This article studies the optimal filtering and control for wireless networked control systems (WNCSs). In WNCSs, packets may be lost in both control and feedback channels and user datagram protocol is usually used to improve the performance of the real-time control. Relevant literature indicates that the conventional optimal filtering for such a system cannot be applied in practice due to the complex calculation with Gaussian mixtures. This paper proposes a novel scheme to realize the optimal filtering and the linear quadratic Gaussian control for WNCSs, in which the controlled node performs a local estimation and the remote-control node performs the final estimation and control, and a synchronization of two estimators is guaranteed by a communication mechanism. An optimal filtering algorithm is developed, the stability condition of the filtering error covariance is obtained, optimal finite-horizon and infinite-horizon control are derived, and the stability of the closed-loop control system is proved. Numerical simulations show the validity and feasibility of the theoretical results.     

Covariance matrix adaptation evolution strategy based design of fixed structure robust H∞ loop shaping controller

This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H_∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H_∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H_∞ loop-shaping controller is compared with the traditional H_∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H_∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H_∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H_∞ loop shaping controller is suitable for real time implementation with good robust stability and performance.     

基于改进人工蜂群算法的多目标绿色柔性作业车间调度研究

针对多目标绿色柔性作业车间调度问题（MGFJSP）的特点，提出从碳排放量、噪声和废弃物这3个指标来综合评定环境污染程度，建立了以最小化最大完成时间和环境污染程度为优化目标的MGFJSP模型，并提出了一种改进的人工蜂群算法来求解该模型。算法的具体改进包括：设计了一种三维向量的编码和对应解码方案，在跟随蜂搜索阶段引入一种有效的动态邻域搜索操作来提高算法的局部搜索能力，在侦查蜂阶段提出产生新食物源的策略用于增加种群的多样性。最后进行了实验研究与算法对比，以验证所建模型和所提算法的有效性。     

Multilevel adaptive control of nonlinear interconnected systems

This paper presents an adaptive backstepping-based multilevel approach for the first time to control nonlinear interconnected systems with unknown parameters. The system consists of a nonlinear controller at the first level to neutralize the interaction terms, and some adaptive controllers at the second level, in which the gains are optimally tuned using genetic algorithm. The presented scheme can be used in systems with strong couplings where completely ignoring the interactions leads to problems in performance or stability. In order to test the suitability of the method, two case studies are provided: the uncertain double and triple coupled inverted pendulums connected by springs with unknown parameters. The simulation results show that the method is capable of controlling the system effectively, in both regulation and tracking tasks.     

A multi-start central force optimization for global optimization

Central force optimization (CFO) is an efficient and powerful population-based intelligence algorithm for optimization problems. CFO is deterministic in nature, unlike the most widely used metaheuristics. CFO, however, is not completely free from the problems of premature convergence. One way to overcome local optimality is to utilize the multi-start strategy. By combining the respective advantages of CFO and the multi-start strategy, a multi-start central force optimization (MCFO) algorithm is proposed in this paper. The performance of the MCFO approach is evaluated on a comprehensive set of benchmark functions. The experimental results demonstrate that MCFO not only saves the computational cost, but also performs better than some state-of-the-art CFO algorithms. MCFO is also compared with representative evolutionary algorithms. The results show that MCFO is highly competitive, achieving promising performance.     

Optimal scheduling of single stage batch plants with direct heat integration

This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method.     

Mixed coordination mechanisms for scheduling games on hierarchical machines

In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight.