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 proble

Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign

Cross-selling campaigns seek to offer the right products to the set of customers with the goal of maximizing expected profit, while, at the same time, respecting the purchasing constraints set by investors. In this context, a bi-objective version of this NP-Hard problem is approached in this paper, aiming at maximizing both the promotion campaign total profit and the risk-adjusted return, which is estimated with the reward-to-variability ratio known as Sharpe ratio. Given the combinatorial nature of the problem and the large volume of data, heuristic methods are the most common used techniques. A Greedy Randomized Neighborhood Structure is also designed, including the characteristics of a neighborhood exploration strategy together with a Greedy Randomized Constructive technique, which is embedded in a multi-objective local search metaheuristic. The latter combines the power of neighborhood exploration by using a Pareto Local Search with Variable Neighborhood Search. Sets of non-dominated solutions obtained by the proposed method are described and analyzed for a number of problem instances