četrtek, 9. februar 2012 Seminar MARA

V ponedeljek, 13. februarja 2012, bo ob 16.00  uri v prostorih Fakultete za matematiko, naravoslovje in informacijske tehnologije Univerze na Primorskem, Glagoljaška 8, Koper predavanje v okviru skupnega SEMINARJA ZA MATEMATIČNE IN RAČUNALNIŠKE ZNANOSTI Oddelka za matematiko in Oddelka za Informacijske znanosti in tehnologije UP FAMNIT, Oddelka za matematiko in Oddelka za Informacijske znanosti in tehnologije UP PINT, Oddelka za matematiko in računalništvo UP PEF ter Oddelkov za matematiko in teoretično računalništvo IMFM.

RAČUNALNIŠKI SEMINAR

Prostor: FAMNIT-1-RU1 ob 16:00

Predavatelj: Milan Đorđević

Povzetek:
We consider the problem when visitor wants to visit all interesting sites in a city exactly once and to come back to the hotel. Since, the visitors use streets, walking trails and pedestrian zones. The goal is to minimize the visitor’s traveling . A new problem the Traveling Visitor Problem (TVP) is then similar to the Traveling Salesman Problem (TSP) with a difference that the traveling visitors, during its visit of sites, can not fly over buildings in the city, instead visitors have to go around these obstacles. That means that all ”air” distances, like those in a TSP, are impossible in this case. The tested benchmarks are combined from three real instances made using tourist maps of cities of Koper, Belgrade and Venice and two instances of modified cases from TSPLIB. We compared two methods for solving the Traveling Visitor Problem. In all tested cases the Koper Algorithm significantly outperforms the Naive Algorithm for solving the Traveling Visitor Problem.

Vabljeni!