The set orienteering problem

DOI10.1016/j.ejor.2017.11.009zbMath1403.90197OpenAlexW2775816300MaRDI QIDQ1754239

Francesco Carrabs, Claudia Archetti, Raffaele Cerulli

Publication date: 30 May 2018

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

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

zbMATH Keywords

routingmatheuristicorienteering problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (11)

Selective generalized travelling salesman problem ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ Making opportunity sales in attended home delivery ⋮ An adaptive memory matheuristic for the set orienteering problem ⋮ Planning robust drone-truck delivery routes under road traffic uncertainty ⋮ An iterated local search for a multi‐period orienteering problem arising in a car patrolling application ⋮ Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants ⋮ The clustered team orienteering problem ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ A biased random-key genetic algorithm for the set orienteering problem ⋮ Spatial coverage in routing and path planning problems

Uses Software

• VRP

Cites Work

• Unnamed Item
• The clustered orienteering problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• A comparative analysis of several asymmetric traveling salesman problem formulations
• Vehicle Routing
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: The set orienteering problem