A fast solution method for the time-dependent orienteering problem
From MaRDI portal
Publication:2356249
DOI10.1016/j.ejor.2013.11.038zbMath1317.90056OpenAlexW2059762964MaRDI QIDQ2356249
Pieter Vansteenwegen, C. Verbeeck, Kenneth Sörensen, El-Houssaine Aghezzaf
Publication date: 29 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/431471
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ Time dependent orienteering problem with time windows and service time dependent profits ⋮ Efficient meta-heuristics for the multi-objective time-dependent orienteering problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ Time-dependent routing problems: a review ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ The time-dependent orienteering problem with time windows: a fast ant colony system ⋮ The time-dependent capacitated profitable tour problem with time windows and precedence constraints ⋮ Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Optimizing the composite cost involved in road motor-transporting trucks by taking into account traffic condition ⋮ Electric vehicle routing problem with time-dependent waiting times at recharging stations ⋮ Solving the stochastic time-dependent orienteering problem with time windows ⋮ Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times ⋮ A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints ⋮ A time-dependent hierarchical Chinese postman problem ⋮ Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory ⋮ Ant colony optimization for path planning in search and rescue operations ⋮ Rollout-based routing strategies with embedded prediction: a fish trawling application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The orienteering problem: a survey
- The generalized fixed-charge network design problem
- The selective travelling salesman problem
- Vehicle routing with stochastic time-dependent travel times
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
- A fast and effective heuristic for the orienteering problem
- A heuristic for the multiple tour maximum collection problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- A dynamic vehicle routing problem with time-dependent travel times
- Approximation algorithms for time-dependent orienteering.
- Vehicle dispatching with time-dependent travel times
- A network-consistent time-dependent travel time layer for routing optimization problems
- Vehicle routing with dynamic travel times: a queueing approach
- Time dependent vehicle routing problem with a multi ant colony system
- Vehicle routing and scheduling with dynamic travel times
- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem
- The orienteering problem
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- The Orienteering Problem with Time Windows
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Solving the Orienteering Problem through Branch-and-Cut
