Sciweavers

1184 search results - page 6 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
78
Voted
CEC
2008
IEEE
15 years 3 months ago
Dynamic adaptation and multiobjective concepts in a particle swarm optimizer for constrained optimization
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
Jorge Isacc Flores-Mendoza, Efrén Mezura-Mo...
HM
2010
Springer
157views Optimization» more  HM 2010»
14 years 10 months ago
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...
André Renato Villela da Silva, Luiz Satoru ...
CP
2000
Springer
15 years 1 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
14 years 10 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 4 months ago
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
Lanshan Han, M. Kanat Camlibel, Jong-Shi Pang, W. ...