The clustered team orienteering problem

DOI10.1016/j.cor.2019.07.008zbMath1458.90153OpenAlexW2961954026WikidataQ127465165 ScholiaQ127465165MaRDI QIDQ2273693

Ala-Eddine Yahiaoui, Mehdi Serairi, Aziz Moukrim

Publication date: 25 September 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.07.008

zbMATH Keywords

clustercutting planeadaptive large neighborhood searchteam orienteering problemsplit procedure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

A reinforcement learning approach to the orienteering problem with time windows ⋮ A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case) ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows ⋮ The first AI4TSP competition: learning to solve stochastic routing problems

Cites Work

• The clustered orienteering problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
• Solving the team orienteering problem with cutting planes
• The orienteering problem: a survey
• The symmetric clustered traveling salesman problem
• The team orienteering problem
• A fast algorithm for the maximum clique problem
• A fast two-level variable neighborhood search for the clustered vehicle routing problem
• Hybrid heuristic for the clustered orienteering problem
• The set orienteering problem
• Generating subtour elimination constraints for the TSP from pure integer solutions
• Subgraph extraction and metaheuristics for the maximum clique problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Solving the Orienteering Problem through Branch-and-Cut
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: The clustered team orienteering problem