Solving the stochastic time-dependent orienteering problem with time windows
From MaRDI portal
Publication:1751260
DOI10.1016/j.ejor.2016.05.031zbMath1394.90131OpenAlexW2463987837MaRDI QIDQ1751260
C. Verbeeck, El-Houssaine Aghezzaf, Pieter Vansteenwegen
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://biblio.ugent.be/publication/6379766
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Robust Team Orienteering Problem with Decreasing Profits ⋮ Selective generalized travelling salesman problem ⋮ The time-dependent capacitated profitable tour problem with time windows and precedence constraints ⋮ Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ Rough approximation-based approach for designing a personalized tour route under a fuzzy environment ⋮ The first AI4TSP competition: learning to solve stochastic routing problems ⋮ Planning robust drone-truck delivery routes under road traffic uncertainty ⋮ Electric vehicle routing problem with time-dependent waiting times at recharging stations ⋮ Multi-period orienteering with uncertain adoption likelihood and waiting at customers ⋮ Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
Cites Work
- A note on two problems in connexion with graphs
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- A priori orienteering with time windows and stochastic wait times at customers
- A two-stage approach to the orienteering problem with stochastic weights
- Minimum cost VRP with time-dependent speed data and congestion charge
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- Time-dependent routing problems: a review
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
- Robust UAV mission planning
- The orienteering problem: a survey
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- The orienteering problem with stochastic travel and service times
- Iterated local search for the team orienteering problem with time windows
- Travel time reliability in vehicle routing and scheduling with time windows
- The vehicle routing problem. Latest advances and new challenges.
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Vehicle routing with stochastic time-dependent travel times
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- A fast and effective heuristic for the orienteering problem
- A heuristic for the multiple tour maximum collection problem
- Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
- 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
- A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
- A fast solution method for the time-dependent orienteering problem
- Vehicle routing with dynamic travel times: a queueing approach
- Time dependent vehicle routing problem with a multi ant colony system
- Arriving on time
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- Vehicle routing and scheduling with dynamic travel times
- Ensuring service levels in routing problems with time windows and stochastic travel times
- Analysis of the single-vehicle cyclic inventory routing problem
- Vehicle routing with soft time windows and Erlang travel times
- The orienteering problem
- The Orienteering Problem with Time Windows
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Algorithms for a stochastic selective travelling salesperson problem
- Vehicle routing and scheduling with time-varying data: A case study
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- A New Measure of Travel Time Reliability for In-Vehicle Navigation Systems
