If the distances of TSP satisfy the triangle inequality, the minimum-cost-spanning tree (MST) heuristics produces a tour whose length is guaranteed to be less than 2 times the optimum tour length and Christofides’ heuristics generates the 3/2 times the optimum tour length. Otherwise, the quality of the approximation is hard to evaluate. Here a four vertices and three lines inequality is used to...

In this paper we apply a Population based Ant Colony Optimization (PACO) algorithm for solving the following new version of the Traveling Salesperson problem that is called the Combined Tours TSP (CT-TSP). Given are a set of cities, for each pair of cities a cost function and an integer k. The aim is to find a set of k (cyclic) tours, i.e., each city is contained exactly once in each tour and e...

A Constructive Algorithm to Prove P=NP Duan Wen-Qi ([email protected]) College of Economics and Management, Zhejiang Normal University, Jinhua, 321004, China Abstract: After reducing the undirected Hamiltonian cycle problem into the TSP problem with cost 0 or 1, we developed an effective algorithm to compute the optimal tour of the transformed TSP. Our algorithm is described as a growth pro...

Viewdata (i.e. videotex) has been the underlying technology for electronic package holiday distribution in Britain for two decades. Increasingly, however, there is a need to move away from this technology platform towards a more modern and flexible electronic commerce environment in which travel and tourism companies can trade. The emergence of Internet-based and other technologies as well as c...

Pandemi menghentikan perkuliahan tatap muka secara mendadak. Hal ini mengakibatkan sejumlah mata kuliah harus menyesuaikan, pun juga pendidik dan peserta didik dipaksa untuk melek teknologi. Manajemen Bisnis Perjalanan STP kemudian melakukan penyesuaian tugas yang berkaitan dengan studi lapangan, salah satunya menyelenggarakan virtual tour menjadi tren di masa pandemi seperti sekarang.

Virtual tour is a prominent problem in virtual reality research. In this paper, we review some virtual tour system and propose a project plan of “Virtual tour in Tsinghua University”. The core code and the prototype of the system are completed. Experimental results show that our design is feasible and effective. It can bring the feeling of reality and immersion.

In this paper, we propose a personal navigation system for tourism called P-Tour. When a tourist specifies multiple destinations with relative importance and restrictions on arrival/staying time, P-Tour computes the nearly best schedule to visit part of those destinations. In addition to the map-based navigation, P-Tour provides temporal guidance according to the schedule, and automatically mod...

The knight’s tour problem is an old problem. It was investigated by Euler as well as a number of other researchers in recent years. This work describes the author’s history with the problem, reviews the current work and the implementation. The work describes the algorithm, a depth first search with no bias or heuristic, and provides a discussion along with future work of this work. The work use...