Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem

DOI10.1016/J.EJOR.2022.02.045OpenAlexW4214554976WikidataQ113875419 ScholiaQ113875419MaRDI QIDQ2158007

Hyun-Joon Kim, Byung-In Kim

Publication date: 22 July 2022

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

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

zbMATH Keywords

dynamic programmingexact approachboundingmulti-profit orienteering problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Solving the orienteering problem with time windows via the pulse framework
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple 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
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• Strong linear programming relaxations for the orienteering problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• An exact algorithm for team orienteering problems
• An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• The Orienteering Problem with Time Windows
• An Optimal Algorithm for the Orienteering Tour Problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Solving the Orienteering Problem through Branch-and-Cut
• Generalized orienteering problem with resource dependent rewards
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• The orienteering problem with variable profits

This page was built for publication: Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem