59 search results - page 11 / 12 » Optimization of the Nested Monte-Carlo Algorithm on the Trav... |
CORR
2006
Springer
13 years 6 months ago
2006
Springer
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...
TAMC
2009
Springer
13 years 10 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
COMPSAC
2004
IEEE
13 years 9 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
STOC
2002
ACM
14 years 6 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...