Heuristics for the multi-period orienteering problem with multiple time windows
From MaRDI portal
Publication:732904
DOI10.1016/j.cor.2009.05.012zbMath1175.90212OpenAlexW2082675302WikidataQ59389667 ScholiaQ59389667MaRDI QIDQ732904
Fabien Tricoire, Richard F. Hartl, Martin Romauch, Karl F. Doerner
Publication date: 15 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.012
Related Items (34)
Notes on the single route lateral transhipment problem ⋮ A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Scheduled penalty variable neighborhood search ⋮ A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints ⋮ Bi-objective orienteering for personal activity scheduling ⋮ An efficient evolutionary algorithm for the orienteering problem ⋮ Multi-directional local search ⋮ Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem ⋮ The capacitated team orienteering problem with incomplete service ⋮ Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows ⋮ Branch-and-check approaches for the tourist trip design problem with rich constraints ⋮ A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case) ⋮ The team orienteering problem with time windows: an LP-based granular variable neighborhood search ⋮ Coupling ant colony systems with strong local searches ⋮ The orienteering problem: a survey ⋮ Formulations for the orienteering problem with additional constraints ⋮ Hybridized evolutionary local search algorithm for the team orienteering problem with time windows ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ A unified matheuristic for solving multi-constrained traveling salesman problems with profits ⋮ Vehicle routing with arrival time diversification ⋮ The sales force sizing problem with multi-period workload assignments, and service time windows ⋮ A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints ⋮ The vehicle routing problem with profits and consistency constraints ⋮ An iterative three-component heuristic for the team orienteering problem with time windows ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling ⋮ An effective PSO-inspired algorithm for the team orienteering problem
Cites Work
- Scheduling periodic customer visits for a traveling salesperson
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- 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
- The team orienteering problem
- A fast and effective heuristic for the orienteering problem
- Variable neighborhood search
- A TABU search heuristic for the team orienteering problem
- A variable neighborhood search heuristic for periodic routing problems
- A guided local search metaheuristic for the team orienteering problem
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Computer Solutions of the Traveling Salesman Problem
- Variable neighborhood search: Principles and applications
This page was built for publication: Heuristics for the multi-period orienteering problem with multiple time windows
