Sciweavers

191 search results - page 24 / 39
» A fuzzy adaptive neighborhood search for function optimizati...
Sort
View
EOR
2010
116views more  EOR 2010»
14 years 10 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 3 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
CEC
2009
IEEE
15 years 1 months ago
A dynamic artificial immune algorithm applied to challenging benchmarking problems
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
Fabrício Olivetti de França, Fernand...
GECCO
2006
Springer
173views Optimization» more  GECCO 2006»
15 years 1 months ago
Ant colony optimization technique for equilibrium assignment in congested transportation networks
This paper deals with transport user equilibrium. A modified version of the ant colony system is proposed where the ant colony heuristic is adapted in order to take into account a...
Matteo Matteucci, Lorenzo Mussone
GECCO
2004
Springer
15 years 3 months ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer