Sciweavers

Share
39 search results - page 1 / 8
» A hybrid heuristic approach for solving the generalized trav...
Sort
View
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
8 years 10 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
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...
Petrica C. Pop, Serban Iordache
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
10 years 1 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
AIPS
2013
5 years 1 months ago
Constricting Insertion Heuristic for Traveling Salesman Problem with Neighborhoods
Sequence optimization is an important problem in many production automation scenarios involving industrial robots. Mostly, this is done by reducing it to Traveling Salesman Proble...
Sergey Alatartsev, Marcus Augustine, Frank Ortmeie...
EVOW
2005
Springer
10 years 14 days ago
Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem
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...
Juan José Pantrigo, Abraham Duarte, Á...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
10 years 14 days ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
books