Optimalno planiranje poti v gradbeništvu z reševanjem problema trgovskega potnika

Uroš Klanšek (Author), Mirko Pšunder (Author), Marko Soršak (Author)

Abstract

Problem trgovskega potnika (PTP) predstavlja enega najbolj znanih problemov kombinatorične optimizacije. Reševanje PTP izkazuje pomemben aplikativni potencial za gradbeništvo. Zato je namen pričujočega članka približati reševanje PTP širši gradbeniški skupnosti. V članku so predstavljeni formulacija PTP, uporabnost optimizacijskega modela PTP ter nekateri komercialno dostopni programski paketi, ki se lahko uporabijo za modeliranje in reševanje PTP. Na koncu članka je predstavljen primer optimalnega planiranja poti z reševanjem PTP.

Keywords

problem trgovskega potnika;kombinatorična optimizacija;optimizacijski problemi;optimizacija poti;gradbeništvo;

Data

Language:	Slovenian
Year of publishing:	2011
Typology:	1.04 - Professional Article
Organization:	UM FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
UDC:	69:519.17
COBISS:	15018262
ISSN:	0017-2774
Parent publication:	Gradbeni vestnik
Views:	1265
Downloads:	51
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Optimal route planning in civil engineering by solving traveling salesman problem
Secondary abstract:	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.
URN:	URN:NBN:SI
Type (COBISS):	Not categorized
Pages:	str. 143-151
Volume:	ǂLetn. ǂ60
Issue:	ǂšt. ǂ[5]
Chronology:	maj 2011
ID:	9102473