88 search results - page 9 / 18 » A random-key genetic algorithm for the generalized traveling... |
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 ...
GECCO
2009
Springer
14 years 3 days ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
METMBS
2003
13 years 8 months ago
2003
In this paper we revisit the idea of relating the genetic code to a Gray code. This idea was originally fostered by Rosemary Swanson as a “unifying concept for the amino acid co...