203 search results - page 26 / 41 » Biogeography Migration Algorithm for Traveling Salesman Prob... |
APPROX
2008
Springer
15 years 18 days ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
ALGORITHMICA
2005
14 years 10 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
107
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
SASO
2007
IEEE
15 years 4 months ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
GECCO
2000
Springer
15 years 2 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...