List your company

Traveling Salesman Problem with Time Window on TSPTW Easy n=50

0Infeasible % (Instances)LKH3
-4235077Oct 28, 2024

Evaluation results

MethodLinks
LKH3n=50, hardness=Easy2024.10007.3104.6
ORToolsn=50, hardness=Easy2024.10007.340.967
Greedy-Cn=50, hardness=Easy2024.100026.08257.274.5
JAMPRn=50, hardness=Easy2024.100——249.031.2
AM* + PIPn=50, hardness=Easy, framework=PIP2024.1000.557.877.6710.7
AM* + PIP-Dn=50, hardness=Easy, framework=PIP-D2024.1000.517.918.1911
POMO*n=50, hardness=Easy2024.1001.757.543.0813
POMO* + PIPn=50, hardness=Easy, framework=PIP2024.1000.327.52.6515
POMO* + PIP-Dn=50, hardness=Easy, framework=PIP-D2024.1000.287.492.5115
MUSLA adaptn=50, hardness=Easy2024.100.1——5.637.7
AM*n=50, hardness=Easy2024.100.223.468.029.825.2
MUSLAn=50, hardness=Easy2024.108.2——7.321.3
OSLAn=50, hardness=Easy2024.1011.8——8.1515.6
Greedy-Ln=50, hardness=Easy2024.10100100——13.8
AMn=50, hardness=Easy2024.10100100——5
POMOn=50, hardness=Easy2024.10100100——13