Sciweavers

231 search results - page 10 / 47
» Dispersion-Based Population Initialization
Sort
View
IFIP
2004
Springer
15 years 3 months ago
Solving Geometrical Place Problems by using Evolutionary Algorithms
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
Crina Grosan
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 11 months ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
EPS
1998
Springer
15 years 2 months ago
Evolving Heuristics for Planning
Abstract. In this paper we describe EvoCK, a new approach to the application of genetic programming (GP) to planning. This approach starts with a traditional AI planner (PRODIGY)an...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
HICSS
2012
IEEE
308views Biometrics» more  HICSS 2012»
13 years 5 months ago
Understanding Smart Cities: An Integrative Framework
Making a city “smart” is emerging as a strategy to mitigate the problems generated by the urban population growth and rapid urbanization. Yet little academic research has spar...
Hafedh Chourabi, Taewoo Nam, Shawn Walker, Jos&eac...
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 1 months ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter