Problem trgovskega potnika (asimetrični)

Slike simbolizirajo raziskovalno delo laboratorija in so ustvarjene s pomočjo AI

Instance size (number of nodes)
4 (min cost = 15)
5 (min cost = 20)
6 (min cost = 25)

Initial cost configuration
Static configuration
Random configuration

Cost: {{ cost }} ✓ Solution found!
Click counter: {{ counter }}
Note:
The objective is to find a valid Hamiltonian cycle — a path that visits each node exactly once and returns to the starting point — with the lowest total cost.

Selecting a node highlights it; selecting it again deselects it. These actions do not affect the click counter.
Selecting two different nodes creates an edge between them. Selecting the same two nodes again removes the edge; selecting them in reverse order reverses its direction.
On larger screens, you can also click edges or their cost labels (when no node is selected) to toggle or reverse a connection. On smaller screens, edges can only be created by selecting two nodes.

Raziskovalna dejavnost

Objave

Brest, Janez; Brest, Aljaž; Pšeničnik, Blaž; Popič, Jan; Berkovič, Klemen; Bošković, Borko

Ciljni pristop pri reševanju nesimetričnega trgovskega potnika Proceedings Article

In: pp. 357–360, Slovenska sekcija IEEE; Fakulteta za elektrotehniko, 2025.

Links | BibTeX

Brest, Janez; Žerovnik, Janez

A heuristic for the asymmetric traveling salesman problem Proceedings Article

In: 6th Metaheuristics International Conference, pp. 145–150, Citeseer 2005.

BibTeX

Brest, Janez; Žerovnik, Janez

An approximation algorithm for the asymmetric traveling salesman problem Journal Article

In: Ricerca operativa, vol. 28, pp. 59–67, 1999.

Links | BibTeX