Traveling Salesman Problem with Time Windows on TSPTW hard variant (n=50)
0Infeasibility RateCaR-PIP
Evaluation Results
| Method | Links | |||
|---|---|---|---|---|
| CaR-PIPTR=20, #Params=1.64M, Paradigm=L2(C+I)-S, Time=52s2026.02 | 0 | 25.612 | 0.5 | |
| CaR-POMOTR=10, #Params=1.64M, Paradigm=L2(C+I)-S, Time=27s2026.02 | 0.01 | 25.615 | 2 | |
| CaR-POMOTR=20, #Params=1.64M, Paradigm=L2(C+I)-S, Time=51s2026.02 | 0.01 | 25.614 | 1.4 | |
| CaR-PIPTR=10, #Params=1.64M, Paradigm=L2(C+I)-S, Time=29s2026.02 | 0.01 | 25.612 | 0.6 | |
| NeuOpt-GIRE#Params=0.69M, Paradigm=L2I-S, T=5k, Time=11.6m2026.02 | 0.02 | 25.617 | 2.8 | |
| CaR-POMOTR=5, #Params=1.64M, Paradigm=L2(C+I)-S, Time=15s2026.02 | 0.02 | 25.619 | 3.4 | |
| CaR-PIPTR=5, #Params=1.64M, Paradigm=L2(C+I)-S, Time=17s2026.02 | 0.02 | 25.613 | 1 | |
| NeuOpt-GIRE#Params=0.69M, Paradigm=L2I-S, T=2k, Time=4.6m2026.02 | 0.04 | 25.621 | 4.4 | |
| LKH-3max trials=10000, Paradigm=I, Time=7h2026.02 | 0.12 | 25.611 | 0 | |
| NeuOpt-GIRE#Params=0.69M, Paradigm=L2I-S, T=1k, Time=2.3m2026.02 | 0.19 | 25.627 | 6.1 | |
| POMO* + PIP (sample 10)#Params=1.25M, Paradigm=L2C-S, Time=1m2026.02 | 1.87 | 25.65 | 15.2 | |
| POMO* + PIP (greedy)#Params=1.25M, Paradigm=L2C-S, Time=7s2026.02 | 2.67 | 25.657 | 17.7 | |
| LKH-3max trials=100, Paradigm=I, Time=7m2026.02 | 11.88 | 25.59 | 0.4 | |
| POMO*#Params=1.25M, Paradigm=L2C-S, Time=4s2026.02 | 37.27 | 26.222 | 163.5 | |
| OR-ToolsParadigm=I, Time=2.4h2026.02 | 65.72 | 25.763 | -0.1 | |
| Greedy-CParadigm=C, Time=4.5s2026.02 | 72.55 | 26.394 | 153.4 | |
| Greedy-LParadigm=C, Time=21.8s2026.02 | 100 | — | — | |
| POMO#Params=1.25M, Paradigm=L2C-S, Time=4s2026.02 | 100 | — | — | |
| UDC*#Params=1.56M, Paradigm=L2C-S, RRC=250, Time=2.4h2026.02 | 100 | — | — | |
| NCS#Params=1.64M, Paradigm=L2(C+I)-S, Time=11.6m2026.02 | 100 | — | — |