A reinforcement learning approach to the orienteering problem with time windows

DOI10.1016/J.COR.2021.105357OpenAlexW3160721969MaRDI QIDQ2668790

Hugo L. Fernandes, Ricardo Gama

Publication date: 7 March 2022

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

Full work available at URL: https://arxiv.org/abs/2011.03647

zbMATH Keywords

combinatorial optimizationmachine learning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (5)

Trip planning for visitors in a service system with capacity constraints ⋮ The first AI4TSP competition: learning to solve stochastic routing problems ⋮ A reinforced hybrid genetic algorithm for the traveling salesman problem ⋮ Optimal pivot path of the simplex method for linear programming based on reinforcement learning ⋮ A deep reinforcement learning assisted simulated annealing algorithm for a maintenance planning problem

Uses Software

• Adam
• Tensor2Tensor

Cites Work

• Orienteering problem: a survey of recent variants, solution approaches and applications
• The orienteering problem: a survey
• Iterated local search for the team orienteering problem with time windows
• A matheuristic approach to the orienteering problem with service time dependent profits
• Learning heuristics for the TSP by policy gradient
• An effective large neighborhood search for the team orienteering problem with time windows
• Attractive orienteering problem with proximity and timing interactions
• Simple statistical gradient-following algorithms for connectionist reinforcement learning
• A Tabu search algorithm for the probabilistic orienteering problem
• The clustered team orienteering problem
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows

This page was built for publication: A reinforcement learning approach to the orienteering problem with time windows