A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints

DOI10.1016/J.COR.2015.11.007zbMath1391.90528OpenAlexW2184869115MaRDI QIDQ1652104

André Langevin, Gilbert Laporte, Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar

Publication date: 11 July 2018

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

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

zbMATH Keywords

variable neighborhood searchorienteering problemgreedy randomized adaptive search procedureselective traveling salesman problem

Mathematics Subject Classification ID

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

Related Items (6)

An iterated local search algorithm for the team orienteering problem with variable profits ⋮ Branch-and-check approaches for the tourist trip design problem with rich constraints ⋮ Formulations for the orienteering problem with additional constraints ⋮ An iterated local search for a multi‐period orienteering problem arising in a car patrolling application ⋮ A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints ⋮ An adaptive large neighborhood search approach for multiple traveling repairman problem with profits

Cites Work

• Unnamed Item
• The multi-district team orienteering problem
• Variable neighborhood search for location routing
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• Iterated local search for the team orienteering problem with time windows
• The selective travelling salesman problem
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
• A probabilistic heuristic for a computationally difficult set covering problem
• The team orienteering problem
• A heuristic for the multiple tour maximum collection problem
• Variable neighborhood search
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
• A TABU search heuristic for the team orienteering problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• Multiobjective GRASP with path relinking
• A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
• The orienteering problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• Solving the Orienteering Problem through Branch-and-Cut

This page was built for publication: A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints