Open main menu

A.F.C algorithm

A fractal polynomial approximation for T.S.P

Create or load new problem

IMPORTANT : Please reload this page to ensure curent problem is flushed from session

Load from TSP url :
(URL's and optimal tours can be found here or here)



TSP benchmarks

TSP benchmarks

Tour computed by A.F.C in 15,2 sec, for "pcb3038 : Drilling problem (Junger/Reinelt)"

COMMENT : Drilling problem (Junger/Reinelt)