Sciweavers

498 search results - page 25 / 100
» Optimization of Genetic Operators for Scheduling Problems
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
A Cellular Multi-Objective Genetic Algorithm for Optimal Broadcasting Strategy in Metropolitan MANETs
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenar...
Enrique Alba, Bernabé Dorronsoro, Francisco...
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
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 1 months ago
A comparative study of immune system based genetic algorithms in dynamic environments
Diversity and memory are two major mechanisms used in biology to keep the adaptability of organisms in the everchanging environment in nature. These mechanisms can be integrated i...
Shengxiang Yang
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
14 years 10 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
GECCO
2003
Springer
15 years 2 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene