A cooperative coevolution algorithm for large-scale multi-city itinerary planning, with a claimed weak-decomposability guarantee, outperforms four baselines on 18 real-world test cases.
The orien- teering problem: A survey,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Decomposability-Guaranteed Cooperative Coevolution for Large-Scale Itinerary Planning
A cooperative coevolution algorithm for large-scale multi-city itinerary planning, with a claimed weak-decomposability guarantee, outperforms four baselines on 18 real-world test cases.