Problem trgovskega potnika (asimetrični)

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

TSP Asymmetric — Homepage@labraj
Instance size (number of nodes)
 4 (min energy = {{ minEnergies[4] || 15 }})
 5 (min energy = {{ minEnergies[5] || 20 }})
 6 (min energy = {{ minEnergies[6] || 25 }}) 		Initial energy configuration
 Static configuration
 Random configuration
Please resize your window or rotate your phone to see graph.

Energy: {{ e }}
Click counter: {{ counter }}
Note:
The objective is to discover a valid Hamiltonian cycle — a path that visits every node exactly once and returns to the starting point — with the lowest possible total energy (cost) using the fewest number of clicks.

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