Traveling Salesman Problem with Time Window on TSPTW n=100 (Easy)
0Infeasible Rate (Instances)LKH3
Evaluation results
| Method | Links | |||||
|---|---|---|---|---|---|---|
| LKH3n=100, hardness=Easy2024.10 | 0 | 0 | 10.21 | 0 | 8.5 | |
| ORToolsn=100, hardness=Easy2024.10 | 0 | 0 | 10.41 | 1.97 | 14 | |
| Greedy-Cn=100, hardness=Easy2024.10 | 0 | 0 | 52.14 | 411.13 | 12 | |
| AM* + PIPn=100, hardness=Easy, framework=PIP2024.10 | 0 | 0.45 | 11.42 | 11.86 | 1 | |
| AM* + PIP-Dn=100, hardness=Easy, framework=PIP-D2024.10 | 0 | 0.25 | 11.53 | 13.02 | 1 | |
| POMO*n=100, hardness=Easy2024.10 | 0 | 2.11 | 10.83 | 6.07 | 21 | |
| POMO* + PIPn=100, hardness=Easy, framework=PIP2024.10 | 0 | 0.15 | 10.57 | 3.53 | 48 | |
| POMO* + PIP-Dn=100, hardness=Easy, framework=PIP-D2024.10 | 0 | 0.06 | 10.66 | 4.39 | 48 | |
| MUSLA adaptn=100, hardness=Easy2024.10 | 0.6 | — | — | 12.01 | 1.1 | |
| AM*n=100, hardness=Easy2024.10 | 1.49 | 7.87 | 11.84 | 16.07 | 21 | |
| MUSLAn=100, hardness=Easy2024.10 | 18.6 | — | — | 14.6 | 9.8 | |
| Greedy-Ln=100, hardness=Easy2024.10 | 100 | 100 | — | — | 1.3 | |
| JAMPRn=100, hardness=Easy2024.10 | 100 | — | — | — | 1.6 |