The Travelling Salesman Problem in the Function of Transport Network Optimalization (original) (raw)
Related papers
Computer tools for solving the traveling salesman problem
Development Management, 2020
The task of the traveling salesman, which is to find the shortest or least costly circular route, is one of the most common optimization problems that need to be solved in various fields of practice. The article analyzes and demonstrates various methods for solving this problem using a specific example: heuristic (the nearest neighbor method, the most profitable neighbor method), metaheuristic (evolutionary algorithm), methods of mathematical programming. In addition to classic exact methods (which are difficult to use for large-scale tasks based on existing software) and heuristic methods, the article suggests using the innovative features of the commercially available MS Excel software using a meta-heuristic base. To find the optimal solution using exact methods, the Excel (Solver) software package was used, as well as the specialized GAMS software package. Comparison of different approaches to solving the traveling salesman problem using a practical example showed that the use of...
The using of solver software and vehicle routing for the traveling salesman problem
2014
The traveling salesman problem (TSP) is one of the most studied problems in management science. Optimal approaches to solving traveling salesman problems are based on mathematical programming. But in reality, most TSP problems are not solved optimally. When the problem is so large that an optimal solution is impossible to obtain, or when approximate solutions are good enough, heuristics are applied. Two commonly used heuristics for the traveling salesman problem are the nearest neighbor procedure and the Clark and Wright savings heuristic. In this paper will be present using of the solver software and principles of TSP for optimal solution of vehicle routing for domestic bottled water and different juices in the different parts of the Republic of Macedonia.
Springer eBooks, 2013
This paper presents a self-contained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances. Extensive computational results are reported on most of the algorithms described. Optimal solutions are reported for instances with sizes up to several thousand nodes as well as heuristic solutions with provably very high quality for larger instances. This is a preliminary version of one of the chapters of the volume "Networks" edited by M.O. Ball, T.
The Travelling Salesman Problem and Related Problems
New formulations are presented for the Travelling Salesman problem, and their relationship to previous formulations is investigated. The new formulations are extended to include a variety of transportation scheduling problems, such as the Multi-Travelling Salesman problem, the Delivery problem, the School Bus problem and the Dial-a-Bus problem. A Benders decomposition procedure is applied on the new formulations and the resulting computational rocedure is seen to be identical to previous methods for solving the Travelling Salesman problem. Based on the Lagrangean Relaxation method, a new procedure is suggested for generating lagrange multipliers for a subgradient optimization procedure.