51 search results - page 3 / 11 » An Improved Greedy Genetic Algorithm for Solving Travelling ... |
EOR
2006
13 years 4 months ago
2006
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
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...
PPSN
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
CEC
2003
IEEE
13 years 10 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...