The clustered orienteering problem

DOI10.1016/j.ejor.2014.04.006zbMath1338.90421OpenAlexW2062548183MaRDI QIDQ296772

Enrico Angelelli, Claudia Archetti, Michele Vindigni

Publication date: 23 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.006

zbMATH Keywords

tabu searchbranch-and-cutorienteering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items (13)

Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact ⋮ A hybrid adaptive large neighborhood search heuristic for the team orienteering problem ⋮ A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case) ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ Clustered coverage orienteering problem of unmanned surface vehicles for water sampling ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants ⋮ The set orienteering problem ⋮ The clustered team orienteering problem ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ A biased random-key genetic algorithm for the set orienteering problem ⋮ The synchronized multi-assignment orienteering problem

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The orienteering problem: a survey
• The selective travelling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• A fast and effective heuristic for the orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Using artificial neural networks to solve the orienteering problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The orienteering problem
• An Optimal Algorithm for the Orienteering Tour 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 orienteering problem