203 search results - page 29 / 41 » Biogeography Migration Algorithm for Traveling Salesman Prob... |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, it is presented a new way to characterize the phenotype in the context of Genetic Algorithms through the use of Game Theory as a theoretical foundation to define a ...
CCO
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
AAAI
2000
13 years 9 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
AEI
2004
13 years 7 months ago
2004
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...