Abstract Traveling Salesman Problem (TSP) is a typical combinatorial optimization problem, and it NP-hard problem. The total number of routes increases exponentially with the cities, so great significance to design an effective algorithm find optimal solution accurately. Chicken Swarm Optimization (CSO) new intelligent algorithm, which mainly proposed for continuous problems. It has advantages ...

An instance of the curve reconstruction problem is a finite sample set V of an unknown collection of curves γ. The task is to connect the points in V in the order in which they lie on γ. Giesen [Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SCG ’99), 1999, pp. 207–216] showed recently that the traveling salesman tour of V solves the reconstruction problem for single cl...

Given a set S of n points in the unit square [0, 1], an optimal traveling salesman tour of S is a tour of S that is of minimum length. A worst-case point set for the Traveling Salesman Problem in the unit square is a point set S whose optimal traveling salesman tour achieves the maximum possible length among all point sets S ⊂ [0, 1], where |S| = n. An open problem is to determine the structure...

There are two major criticisms about simulated annealing as a general method for solving combinatorial optimization problems: its effectiveness when compared with other welldesigned heuristics and its excessive computation time. In this paper, we show that simulated annealing, with properly des~gned annealing schedule and move generation strategy, achieves significant speerlups for high quality...

In the online traveling salesman problem requests for visits to cities (points in a metric space) arrive online while the salesman is traveling. The salesman moves at no more than unit speed and starts and ends his work at a designated origin. The objective is to find a routing for the salesman which finishes as early as possible. Performance of algorithms is measured through their competitive ...