The clustered orienteering problem

DOI10.1016/J.EJOR.2014.04.006MaRDI QIDQ296772zbMATHOpenAlexFDO

Authors Enrico Angelelli, C. Archetti, M. 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

branch-and-cuttabu searchorienteering problem

Mathematics Subject Classification ID

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

Recommendations

• The clustered team orienteering problem
• The set orienteering problem
• Hybrid heuristic for the clustered orienteering problem
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
• The orienteering problem: a survey

Cites work

• scientific article; zbMATH DE number 5764858 (Why is no real title available?)
• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• scientific article; zbMATH DE number 1769325 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A fast and effective heuristic for the orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Optimal Algorithm for the Orienteering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• The orienteering problem
• The orienteering problem: a survey
• The selective travelling salesman problem
• Using artificial neural networks to solve the orienteering problem

Cited in

(17)

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

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: The clustered orienteering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296772)