The clustered orienteering problem

DOI10.1016/J.EJOR.2014.04.006zbMATH Open1338.90421OpenAlexW2062548183MaRDI QIDQ296772FDOQ296772

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

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

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)

Cites Work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The orienteering problem
• The orienteering problem: a survey
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Optimal Algorithm for the Orienteering Tour Problem
• Solving the Orienteering Problem through Branch-and-Cut
• Title not available (Why is that?)
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• The selective travelling salesman problem

Cited In (16)

• An effective hybrid evolutionary algorithm for the clustered orienteering problem
• The synchronized multi-assignment orienteering problem
• Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
• The hazardous orienteering problem
• The set orienteering problem
• The orienteering problem with variable profits
• A Tabu search algorithm for the probabilistic orienteering problem
• The clustered team orienteering problem
• 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 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
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• An adaptive memory matheuristic for the set orienteering problem
• A biased random-key genetic algorithm for the set orienteering problem

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)