Traveling salesman problem on the map of Slovenia

Nika Eržen (2018) Traveling salesman problem on the map of Slovenia. MSc thesis.

Preview

Abstract

The traveling salesman problem is a well known NP-hard problem. Given a list of cities and the distances between each pair of cities, the goal is to find the shortest possible route that visits each city and returns to the origin city. In the thesis we found the solution to the traveling salesman problem on 6007 settlements in Slovenia using the geographical distance between the settlements. To find the solution we used programs LKH and Concorde. With LKH we obtained the upper bound of traveling salesman tour. Than we used Concorde to obtain and improve the lower bound of the traveling salesman tour. We have found the tour of length 7733,125km and have shown that it is optimal.

Item Type:

Thesis (MSc thesis)

Keywords:

traveling salesman problem, geographical data

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
prof. dr. Gašper Fijavž	246	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1538026947)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

4296

Date Deposited:

15 Oct 2018 12:41

Last Modified:

15 Nov 2018 09:08

URI:

http://eprints.fri.uni-lj.si/id/eprint/4296

Actions (login required)

View Item