Sciweavers

36 search results - page 7 / 8
» Bee Colony Optimization with Local Search for Traveling Sale...
Sort
View
AAIM
2005
Springer
110views Algorithms» more  AAIM 2005»
13 years 10 months ago
Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh
EMO
2001
Springer
107views Optimization» more  EMO 2001»
13 years 9 months ago
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
Joshua D. Knowles, Richard A. Watson, David Corne
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
13 years 10 months ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
HM
2005
Springer
140views Optimization» more  HM 2005»
13 years 10 months ago
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
Herman Sontrop, Pieter van der Horn, Marc Uetz
CEC
2010
IEEE
13 years 6 months ago
Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...
Hui Li, Dario Landa Silva, Xavier Gandibleux