An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem

DOI10.1007/978-3-030-72904-2_5zbMath1474.90380OpenAlexW3151825054MaRDI QIDQ2233517

Hoang Thanh Le, Yuhui Shi, Martin Middendorf

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72904-2_5

zbMATH Keywords

dynamic optimizationanytime algorithmsrouting problemsneighborhood search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• The orienteering problem with time windows applied to robotic melon harvesting
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The directed orienteering problem
• The selective travelling salesman problem
• The vehicle routing problem. Latest advances and new challenges.
• Variable neighbourhood search: methods and applications
• The probabilistic orienteering problem
• An efficient evolutionary algorithm for the orienteering problem
• Approximation algorithms for time-dependent orienteering.
• Evolution-inspired local improvement algorithm solving orienteering problem
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• The orienteering problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• The maximum collection problem with time-dependent rewards

This page was built for publication: An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem