109 search results - page 3 / 22 » A discrete particle swarm optimization algorithm for the gen... |
GECCO
2011
Springer
12 years 8 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
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...
PRL
2010
12 years 11 months ago
2010
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
EVOW
2009
Springer
13 years 11 months ago
2009
Springer
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...