Sciweavers

201 search results - page 38 / 41
» Algorithms for the On-Line Quota Traveling Salesman Problem
Sort
View
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
13 years 11 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 7 months ago
Fitness Uniform Optimization
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...
Marcus Hutter, Shane Legg
CONSTRAINTS
2002
129views more  CONSTRAINTS 2002»
13 years 7 months ago
Cost-Based Arc Consistency for Global Cardinality Constraints
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
Jean-Charles Régin
GIS
2007
ACM
13 years 11 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
CEC
2005
IEEE
14 years 1 months ago
A quantitative approach for validating the building-block hypothesis
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutio...
Chatchawit Aporntewan, Prabhas Chongstitvatana