38 search results - page 2 / 8 » A hybrid genetic algorithm and inver over approach for the t... |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
EVOW
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
IJON
2008
13 years 4 months ago
2008
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...