Hybrid heuristic for the clustered orienteering problem

DOI10.1007/978-3-319-68496-3_2zbMath1378.90032OpenAlexW2756951932MaRDI QIDQ1691649

Mehdi Serairi, Ala-Eddine Yahiaoui, Aziz Moukrim

Publication date: 25 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-68496-3_2

zbMATH Keywords

branch and boundknapsack problemsplitadaptive large neighborhood searchclustered orienteering problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

The clustered team orienteering problem

This page was built for publication: Hybrid heuristic for the clustered orienteering problem