Time and Cost Dependent TSP Problem: An Experimentation System for the Practical Users

Abstract

The paper presents various approaches to finding the optimal solution for a problem, which is an extension of the classical travelling salesmen problem (TSP). The problem consists in choosing the route between two distinct towns: starting and target, when there are available not only free standard roads but toll highway, either. The four variants of the problem and three heuristic algorithms solving the formulated problems are under consideration. In the paper is presented the designed and implemented experimentation system which gives opportunities for finding the best route by the practical users. Moreover, this system allows making simulation experiments. On the basis of the obtained results of such experiments the comparative analysis of the algorithms and of the considered variants have been made showing that the proposed approaches seems to be promising.