The clustered team orienteering problem.

Ala-Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi

Computers & Operations Research（2019）

引用 15|浏览7

暂无评分

摘要

•We introduce a new variant of the TOP called the Clustered Team Orienteering Problem. A mathematical model is proposed.•We propose an efficient exact algorithm based on a cutting planes approach to solve the CluTOP.•We extend our heuristic initially proposed for the COP to cover the case with multiple vehicles.•We extend our heuristic initially proposed for the COP to cover the case with multiple vehicles.

查看译文

关键词

Team orienteering problem,Cluster,Cutting plane,Adaptive large neighborhood search,Split procedure

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要