Izvorni znanstveni članak
Using the TSP Solution for Optimal Route Scheduling in Construction Management
Uroš Klanšek
; University of Maribor, Faculty of Civil Engineering, Slovenia
Sažetak
This paper presents the optimal route scheduling in construction
management by using the solution of the traveling salesman
problem (TSP). The TSP is a well-known combinatorial optimization
problem which holds a considerable potential for applications in
construction management. The aim of this paper is to bring forward the
solution of the TSP to the wider expert community. For this purpose,
the TSP model formulation, the applicability of the TSP optimization
model and the commercially available software for modelling and
solving the TSP are presented. An example of the optimal route
scheduling by using the solution of the TSP is demonstrated at the
end of the paper to show the applicability of the TSP model.
Ključne riječi
Construction Management; Route Scheduling; Optimization; Traveling Salesman Problem; Mixed Integer Linear Programming
Hrčak ID:
69500
URI
Datum izdavanja:
1.6.2011.
Posjeta: 3.760 *