11 search results - page 2 / 3 » Probabilistic Traveling Salesman Problem with Deadlines |
ANTSW
2004
Springer
13 years 10 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
ISCI
2008
13 years 5 months ago
2008
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...
AAAI
1998
13 years 6 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
STOC
2002
ACM
14 years 5 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. ...