Sciweavers

88 search results - page 15 / 18
» A random-key genetic algorithm for the generalized traveling...
Sort
View
CEC
2010
IEEE
13 years 8 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
GIS
2008
ACM
13 years 8 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
CEC
2005
IEEE
14 years 1 months ago
A quantitative approach for validating the building-block hypothesis
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutio...
Chatchawit Aporntewan, Prabhas Chongstitvatana
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
14 years 28 days ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
13 years 11 months ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim