Stochastic Route Planning on SOP (Stochastic Orienteering Problem) N = 500 nodes
31.6Mean RewardLMTA
Evaluation Results
| Method | Links | |
|---|---|---|
| LMTAT=10, K=702026.05 | 31.6 | |
| LMTAT=10, K=602026.05 | 30.39 | |
| LMTAT=10, K=502026.05 | 29.79 | |
| GreedyT=10, K=702026.05 | 23.58 | |
| GreedyT=10, K=602026.05 | 21.91 | |
| Flat DQNT=10, K=602026.05 | 18.99 | |
| Flat DQNT=10, K=502026.05 | 18.44 | |
| GreedyT=10, K=502026.05 | 17.17 | |
| WS-optionT=10, K=602026.05 | 17.03 | |
| WS-optionT=10, K=502026.05 | 16.08 | |
| Flat DQNT=10, K=702026.05 | 15.9 | |
| GAT=10, K=702026.05 | 15.23 | |
| GAT=10, K=602026.05 | 14.51 | |
| LMTAT=20, K=102026.05 | 13.51 | |
| WS-optionT=10, K=702026.05 | 12.99 | |
| GAT=10, K=502026.05 | 12.35 | |
| WS-optionT=20, K=102026.05 | 8.04 | |
| GAT=20, K=102026.05 | 7.91 | |
| Flat DQNT=20, K=102026.05 | 7.62 | |
| GreedyT=20, K=102026.05 | 4.89 |