Load allocation problem for optimal design of aircraft electrical power system

More and more electric systems are embedded in today aircraft. As a result, the complexity of electrical power system design is increasing and the need of generic and efficient design methods is today required. Among numerous design tasks, the allocation of electric systems on the busbars of the electrical power system is considered as an important one since it has a direct impact on the aircraft mass. But due to the high number of possible allocations and regarding the large diversity of potential sizing cases for the equipments, finding the optimal allocation of electric loads is a hard task. In this paper, the problem is formalized mathematically. Then, four stochastic optimization methods are assessed on complex load allocation problems. Based on this assessment, a genetic algorithm using niching method is considered as the most appropriate algorithm for solving this aircraft design problem

[1]  D. Magos,et al.  Tabu Search for the planar three-index assignment problem , 1996, J. Glob. Optim..

[2]  P. Miliotis,et al.  An algorithm for the planar three-index assignment problem , 1994 .

[3]  Egon Balas,et al.  An Algorithm for the Three-Index Assignment Problem , 1991, Oper. Res..

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Lionel Pichon,et al.  Reconstruction of faulty wiring networks using reflectometry response and genetic algorithms , 2011 .

[6]  Abdelkader Sbihi,et al.  A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem , 2010, Eur. J. Oper. Res..

[7]  Kenneth C. Gilbert,et al.  An Algorithm for a Class of Three-Dimensional Assignment Problems Arising in Scheduling Applications , 1987 .

[8]  Takeo Yamada,et al.  Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem , 2008, Comput. Oper. Res..

[9]  Sang-Yong Jung,et al.  Optimal design of interior-permanent magnet synchronous machine for vehicle using improved niching genetic algorithm , 2009 .

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Panos M. Pardalos,et al.  GRASP With Path Relinking For The Three-Index Assignment Problem , 2000 .

[12]  Jonathan M. Thompson,et al.  An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem , 2012, Comput. Oper. Res..

[13]  Bruno Sareni,et al.  Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..

[14]  Andrew Lim,et al.  A hybrid genetic algorithm for the Three-Index Assignment Problem , 2006, Eur. J. Oper. Res..

[15]  Gang Yu,et al.  On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications , 1996, Oper. Res..

[16]  David W. Pentico,et al.  Assignment problems: A golden anniversary survey , 2007, Eur. J. Oper. Res..

[17]  Hiroshi Iida A Note on the Max-Min 0-1 Knapsack Problem , 1999, J. Comb. Optim..

[18]  X. Giraud,et al.  Knowledge-based system for aircraft electrical power system reconfiguration , 2012, 2012 Electrical Systems for Aircraft, Railway and Ship Propulsion.

[19]  Panos M. Pardalos,et al.  GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..

[20]  Yves Crama,et al.  Approximation algorithms for three-dimensional assignment problems with triangle inequalities , 1992 .