Pregled bibliografske jedinice broj: 946483
Solving the travelling salesman problem using the branch and bound method
Solving the travelling salesman problem using the branch and bound method // Zbornik Veleučilišta u Rijeci / Journal of the Polytechnic of Rijeka, 4 (2016), 1; 259-270 (domaća recenzija, članak, stručni)
CROSBI ID: 946483 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Solving the travelling salesman problem using the branch and bound method
Autori
Mataija, Mirta ; Rakamarić Šegić, Mirjana ; Jozić, Franciska
Izvornik
Zbornik Veleučilišta u Rijeci / Journal of the Polytechnic of Rijeka (1848-1299) 4
(2016), 1;
259-270
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, stručni
Ključne riječi
Travelling Salesman Problem, Branch and Bound Method, Hamilton path, Hamilton cycle, NP complete problem, NP hard problem
Sažetak
The goal of this paper is to optimize delivering of packages at five randomly chosen addresses in the city of Rijeka. This problem is also known as the Travelling Salesman Problem and it is an NP hard problem. To achieve this goal, the concepts of a Hamilton path and cycle, as well as a Hamilton graph are defined. The theoretical basis for the branch and bound method is also given. The use of this method in the process of finding a solution for a problem is provided at the end of this paper.
Izvorni jezik
Engleski
POVEZANOST RADA
Ustanove:
Veleučilište u Rijeci
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Emerging Sources Citation Index (ESCI)
