A fast solution method for the time-dependent orienteering problem
From MaRDI portal
Publication:2356249
Recommendations
- The time-dependent orienteering problem with time windows: a fast ant colony system
- Solving the stochastic time-dependent orienteering problem with time windows
- scientific article; zbMATH DE number 1839476
- Solving the orienteering problem with time windows via the pulse framework
- Approximation algorithms for time-dependent orienteering.
Cites work
- A dynamic vehicle routing problem with time-dependent travel times
- A fast and effective heuristic for the orienteering problem
- A heuristic for the multiple tour maximum collection problem
- A network-consistent time-dependent travel time layer for routing optimization problems
- A tabu search heuristic for the undirected selective travelling salesman problem
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- Approximation algorithms for time-dependent orienteering.
- scientific article; zbMATH DE number 1488087 (Why is no real title available?)
- scientific article; zbMATH DE number 1769325 (Why is no real title available?)
- Metaheuristics. From design to implementation.
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
- Solving the Orienteering Problem through Branch-and-Cut
- The generalized fixed-charge network design problem
- The orienteering problem
- The Orienteering Problem with Time Windows
- The orienteering problem: a survey
- The selective travelling salesman problem
- Time dependent vehicle routing problem with a multi ant colony system
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Using a genetic algorithm to solve the generalized orienteering problem
- Vehicle dispatching with time-dependent travel times
- Vehicle routing and scheduling with dynamic travel times
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- Vehicle routing with dynamic travel times: a queueing approach
- Vehicle routing with stochastic time-dependent travel times
Cited in
(29)- A fast and effective heuristic for the orienteering problem
- A matheuristic approach to the orienteering problem with service time dependent profits
- The time-dependent capacitated profitable tour problem with time windows and precedence 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
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- Ant colony optimization for path planning in search and rescue operations
- Rollout-based routing strategies with embedded prediction: a fish trawling application
- Boosting ant colony optimization via solution prediction and machine learning
- Time dependent orienteering problem with time windows and service time dependent profits
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
- A solution of the minimum-time speed planning problem based on lattice theory
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times
- A time-dependent hierarchical Chinese postman problem
- Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
- Evolution-inspired local improvement algorithm solving orienteering problem
- The time-dependent orienteering problem with time windows: a fast ant colony system
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Trip planning for visitors in a service system with capacity constraints
- 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
- scientific article; zbMATH DE number 1839476 (Why is no real title available?)
- Solving the stochastic team orienteering problem: comparing simheuristics with the sample average approximation method
- Centralized multi-visitor trip planning with activity reservations in crowded destinations
- A learning-based granular variable neighborhood search for a multi-period election logistics problem with time-dependent profits
This page was built for publication: A fast solution method for the time-dependent orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2356249)
