Sciweavers

46 search results - page 1 / 10
» Algorithms and Experimental Study for the Traveling Salesman...
Sort
View
COCOA
2008
Springer
13 years 6 months ago
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
Gerold Jäger, Paul Molitor
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 7 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
CEC
2010
IEEE
13 years 5 months ago
A hybrid genetic algorithm and inver over approach for the travelling salesman problem
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
Shakeel Arshad, Shengxiang Yang
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 5 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
TSMC
2002
142views more  TSMC 2002»
13 years 4 months ago
Dynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
Weiqi Li, Bahram Alidaee