Simulators for Solving Traveling Salesman Problem Variations with Various Graph Search Methods (CROSBI ID 547401)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Aleksi, Ivan ; Martinović, Goran ; Hocenski, Željko
engleski
Simulators for Solving Traveling Salesman Problem Variations with Various Graph Search Methods
In this work we presented our simulator used for implementing and testing a various graph search methods. Our simulator was created in order to solve the Traveling Salesman Problem (TSP) and its variations. TSP is NP-hard in general. Variations that specializes TSP are even harder. Thus, heuristic algorithm is suitable for solving TSP and similar NP-hard problems. We compared our experimental results with the results gathered from Concorde v1.1, which is a well known simulator, designed for solving the TSP. Brief review of related work is presented, some practical applications are considered and several graphs are searched with comparable results.
traveling salesman; vehicle routing; graph search; TSP/VRP simulator
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
19-24.
2009.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of the 32nd International Convention on Information and Communication Technology, MIPRO09
Bogunović, Nikola ; Ribarić, Slobodan
Opatija: Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO
978-953-233-045-8
Podaci o skupu
MIPRO 2009
predavanje
25.05.2009-29.05.2009
Opatija, Hrvatska
