Time-dependent routing problems: a review
From MaRDI portal
Publication:342083
DOI10.1016/j.cor.2015.06.001zbMath1349.90164OpenAlexW2233419640MaRDI QIDQ342083
Michel Gendreau, Emanuela Guerriero, Gianpaolo Ghiani
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.06.001
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints, A branch-and-bound algorithm for the time-dependent rural postman problem, Scheduling activities with time-dependent durations and resource consumptions, Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, Dealing with time in the multiple traveling salespersons problem with moving targets, An integer programming approach for the time-dependent traveling salesman problem with time windows, A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times, A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem, The traveling purchaser problem with time-dependent quantities, Vehicle routing with backhauls: review and research perspectives, Ants can orienteer a thief in their robbery, A review of vehicle routing with simultaneous pickup and delivery, The secure time-dependent vehicle routing problem with uncertain demands, On path ranking in time-dependent graphs, Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm, A concise guide to existing and emerging vehicle routing problem variants, Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem, The impact of time aggregation and travel time models on time-dependent routing solutions, A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows, The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands, Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Exact and anytime approach for solving the time dependent traveling salesman problem with time windows, Endogenous stochastic optimisation for relief distribution assisted with unmanned aerial vehicles, Optimizing the composite cost involved in road motor-transporting trucks by taking into account traffic condition, The time-dependent vehicle routing problem with time windows and road-network information, Electric vehicle routing problem with time-dependent waiting times at recharging stations, The complexity of routing with collision avoidance, A comparison of algorithms for finding an efficient theme park tour, Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization, Solving the stochastic time-dependent orienteering problem with time windows, Hybrid optimization methods for time-dependent sequencing problems, A hybrid algorithm for time-dependent vehicle routing problem with time windows, Tabu search for the time-dependent vehicle routing problem with time windows on a road network, A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints, Multi-trip time-dependent vehicle routing problem with time windows, A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty, Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels, A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits, A simheuristic algorithm for time-dependent waste collection management with stochastic travel times, An enhanced lower bound for the time-dependent travelling salesman problem, NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times, Comments on: ``Perspectives on integer programming for time-dependent models, Comments on: ``Perspectives on integer programming for time-dependent models, An assign-and-route matheuristic for the time-dependent inventory routing problem
Uses Software
Cites Work
- Unnamed Item
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- A lower bound for the quickest path problem
- Vehicle routing problem with stochastic travel times including soft time windows and service costs
- The time-dependent prize-collecting arc routing problem
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
- Time-dependent SHARC-routing
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
- The dynamic shortest path problem with anticipation
- Empirical validation of a queueing approach to uninterrupted traffic flows
- Arc routing problems with time-dependent service costs
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Vehicle routing with stochastic time-dependent travel times
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- Motion planning among time dependent obstacles
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- Least possible time paths in stochastic, time-varying networks.
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- A dynamic vehicle routing problem with time-dependent travel times
- The time-dependent traveling salesman problem
- Approximation algorithms for time-dependent orienteering.
- Vehicle dispatching with time-dependent travel times
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- A review of dynamic vehicle routing problems
- A network-consistent time-dependent travel time layer for routing optimization problems
- 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
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
- Ranking paths in stochastic time-dependent networks
- Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
- Shortest paths in piecewise continuous time-dependent networks
- Vehicle routing and scheduling with dynamic travel times
- Finding least fuel emission paths in a network with time-varying speeds
- An integer programming approach for the time-dependent TSP
- Bidirectional A* search on time-dependent road networks
- Vehicle Routing
- Minimal Time Vessel Routing in a Time-Dependent Environment
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
- Time-Dependent Route Planning
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
- Formal-Language-Constrained Path Problems
- Efficient modeling of travel in networks with time-varying link speeds
- The time-dependent quickest path problem: Properties and bounds
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- The moving-target traveling salesman problem
- Vehicle routing and scheduling with time-varying data: A case study
- Arc Routing
