58,447 research outputs found
Modified constrained differential evolution for solving nonlinear global optimization problems
Nonlinear optimization problems introduce the possibility of
multiple local optima. The task of global optimization is to find a point
where the objective function obtains its most extreme value while satisfying
the constraints. Some methods try to make the solution feasible
by using penalty function methods, but the performance is not always
satisfactory since the selection of the penalty parameters for the problem
at hand is not a straightforward issue. Differential evolution has
shown to be very efficient when solving global optimization problems
with simple bounds. In this paper, we propose a modified constrained
differential evolution based on different constraints handling techniques,
namely, feasibility and dominance rules, stochastic ranking and global
competitive ranking and compare their performances on a benchmark
set of problems. A comparison with other solution methods available in
literature is also provided. The convergence behavior of the algorithm to
handle discrete and integer variables is analyzed using four well-known
mixed-integer engineering design problems. It is shown that our method
is rather effective when solving nonlinear optimization problems.Fundação para a Ciência e a Tecnologia (FCT
Global competitive ranking for constraints handling with modified differential evolution
Constrained nonlinear programming problems involving a nonlinear objective function with inequality and/or equality constraints introduce the possibility of multiple local optima. The task of global optimization is to find a solution where the objective function obtains its most extreme value while satisfying the constraints. Depending on the nature of the involved functions many solution methods have been proposed. Most of the existing population-based stochastic methods try to make the solution feasible by using a penalty function method. However, to find the appropriate penalty parameter is not an easy task. Population-based differential evolution is shown to be very efficient to solve global optimization problems with simple bounds. To handle the constraints effectively, in this paper, we propose a modified constrained differential evolution that uses self-adaptive control parameters, a mixed modified mutation, the inversion operation, a modified selection and the elitism in order to progress efficiently towards a global solution. In the modified selection, we propose a fitness function based on the global competitive ranking technique for handling the constraints. We test 13 benchmark problems. We also compare the results with the results found in literature. It is shown that our method is rather effective when solving constrained problemsFundação para a Ciência e a Tecnologia (FCT
Optimal Ship Maintenance Scheduling Under Restricted Conditions and Constrained Resources
The research presented in this dissertation addresses the application of evolution algorithms, i.e. Genetic Algorithm (GA) and Differential Evolution algorithm (DE) to scheduling problems in the presence of restricted conditions and resource limitations. This research is motivated by the scheduling of engineering design tasks in shop scheduling problems and ship maintenance scheduling problems to minimize total completion time. The thesis consists of two major parts; the first corresponds to the first appended paper and deals with the computational complexity of mixed shop scheduling problems. A modified Genetic algorithm is proposed to solve the problem. Computational experiments, conducted to evaluate its performance against known optimal solutions for different sized problems, show its superiority in computation time and the high applicability in practical mixed shop scheduling problems. The second part considers the major theme in the second appended paper and is related to the ship maintenance scheduling problem and the extended research on the multi-mode resource-constrained ship scheduling problem. A heuristic Differential Evolution is developed and applied to solve these problems. A mathematical optimization model is also formulated for the multi-mode resource-constrained ship scheduling problem. Through the computed results, DE proves its effectiveness and efficiency in addressing both single and multi-objective ship maintenance scheduling problem
On the Benefits of Surrogate Lagrangians in Optimal Control and Planning Algorithms
This paper explores the relationship between numerical integrators and
optimal control algorithms. Specifically, the performance of the differential
dynamical programming (DDP) algorithm is examined when a variational integrator
and a newly proposed surrogate variational integrator are used to propagate and
linearize system dynamics. Surrogate variational integrators, derived from
backward error analysis, achieve higher levels of accuracy while maintaining
the same integration complexity as nominal variational integrators. The
increase in the integration accuracy is shown to have a large effect on the
performance of the DDP algorithm. In particular, significantly more optimized
inputs are computed when the surrogate variational integrator is utilized
Optimization of force-limiting seismic devices connecting structural subsystems
This paper is focused on the optimum design of an original force-limiting floor anchorage system for the seismic protection of reinforced concrete (RC) dual wall-frame buildings. This protection strategy is based on the interposition of elasto-plastic links between two structural subsystems, namely the lateral force resisting system (LFRS) and the gravity load resisting system (GLRS). The most efficient configuration accounting for the optimal position and mechanical characteristics of the nonlinear devices is obtained numerically by means of a modified constrained differential evolution algorithm. A 12-storey prototype RC dual wall-frame building is considered to demonstrate the effectiveness of the seismic protection strategy
- …