Sciweavers

715 search results - page 24 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
HEURISTICS
2007
139views more  HEURISTICS 2007»
13 years 7 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf
CIKM
2009
Springer
14 years 2 months ago
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
Zhenjiang Lin, Michael R. Lyu, Irwin King
CEC
2007
IEEE
13 years 11 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
ICRA
2007
IEEE
151views Robotics» more  ICRA 2007»
14 years 1 months ago
A Spatially Structured Genetic Algorithm over Complex Networks for Mobile Robot Localisation
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
ESANN
2001
13 years 8 months ago
The synergy between multideme genetic algorithms and fuzzy systems
In this article, a real-coded genetic algorithm (GA) is proposed capable of simultaneously optimizing the structure of a system (number of inputs, membership functions and rules) ...
Ignacio Rojas Ruiz, José Luis Bernier, Edua...