203 search results - page 24 / 41 » Biogeography Migration Algorithm for Traveling Salesman Prob... |
CEC
2011
IEEE
12 years 7 months ago
2011
IEEE
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
JUCS
2010
13 years 6 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
SWARM
2012
SPRINGER
12 years 3 months ago
2012
SPRINGER
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...