“…Using this benchmark as an input to our quantum inspired implementation, we have found out a feasible solution for our benchmark. The order of the nodes after the execution is the following: [0, 6,2,11,19,3,4,8,5,14,15,10,9,7,20,13,18,16,0,12,17,1], and the resulting cost of the produced solution is 319.0. The above results are quite promising and encourage us to apply our research on alternative optimization models to other real world problems as well.…”