The traveling salesman problem (TSP) represents a well-known combinatorial optimization problem. Solving the TSP includes significant potential for civil engineering. In this way, the aim of this paper is to bring forward the solution of the TSP to the wider construction community. The paper presents the TSP formulation, the applicability of the TSP optimization model and the commercially available program packages for modelling and solving the TSP. An example of the optimal route planning by solving the TSP is presented at the end of the paper.

Rights

URN

URN:NBN:SI:DOC-N9KNQQVC

COBISSID

15018262

Added

17.03.2014

Metadata

Citation

APA:

Klanšek, Uroš, Pšunder, Mirko, Soršak, Marko (2011). Optimalno planiranje poti v gradbeništvu z reševanjem problema trgovskega potnika. Gradbeni vestnik, volume 60, issue 5, str. 143-151. URN:NBN:SI:DOC-N9KNQQVC from http://www.dlib.si

MLA:

Klanšek, Uroš, Pšunder, Mirko, Soršak, Marko. "Optimalno planiranje poti v gradbeništvu z reševanjem problema trgovskega potnika." Gradbeni vestnik volume 60. issue 5 (2011) str. 143-151.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-N9KNQQVC>

Gradbeni vestnik
1952-
(Assembly record)

Optimalno planiranje poti v gradbeništvu z reševanjem problema trgovskega potnikaOptimal route planning in civil engineering by solving traveling salesman problem

Optimalno planiranje poti v gradbeništvu z reševanjem problema trgovskega potnika
Optimal route planning in civil engineering by solving traveling salesman problem