The team orienteering problem with variable time windows

DOI10.1111/ITOR.13570MaRDI QIDQ6889523zbMATH OpenFDO

Authors Bibiana Granda, B. Vitoriano

Publication date 4 December 2025

Published in International Transactions in Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1111/ITOR.13570

zbMATH Keywords

integer programmingorienteering problemstime windowswidlfire suppression

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A decomposition approach for the stochastic asset protection problem
• A matheuristic approach to the orienteering problem with service time dependent profits
• A priori orienteering with time windows and stochastic wait times at customers
• A robust optimisation approach for the placement of forest fire suppression resources
• A simulated annealing heuristic for the team orienteering problem with time windows
• Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
• Algorithms to solve the orienteering problem: A comparison
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• An exact algorithm for team orienteering problems
• An iterative three-component heuristic for the team orienteering problem with time windows
• Approximation algorithms for time-dependent orienteering.
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• Finding the K Shortest Loopless Paths in a Network
• Heuristics for the multi-period orienteering problem with multiple time windows
• scientific article; zbMATH DE number 6676558 (Why is no real title available?)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Iterated local search for the team orienteering problem with time windows
• Logic-based Benders decomposition for wildfire suppression
• The multi-visit team orienteering problem with precedence constraints
• The orienteering problem
• The orienteering problem with stochastic travel and service times
• The Orienteering Problem with Time Windows
• The selective travelling salesman problem
• The team orienteering problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Time dependent orienteering problem with time windows and service time dependent profits
• Variable neighborhood search to solve the generalized orienteering problem

This page was built for publication: The team orienteering problem with variable time windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889523)