Time-dependent routing problems: a review (Q342083)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Time-dependent routing problems: a review

scientific article; zbMATH DE number 6654049

Language	Label	Description	Also known as
default for all languages	No label defined
English	Time-dependent routing problems: a review	scientific article; zbMATH DE number 6654049

Statements

instance of

scholarly article

0 references

title

Time-dependent routing problems: a review (English)

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

17 November 2016

0 references

zbMATH Keywords

travel time models

0 references

quickest path problem

0 references

vehicle routing problem

0 references

describes a project that uses

VRP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2015.06.001

0 references

cites work

An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation

0 references

Dynamic shortest path in stochastic dynamic networks: Ship routing problem

0 references

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows

0 references

A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost

0 references

Formal-Language-Constrained Path Problems

0 references

Fast routing in very large public transportation networks using transfer patterns

0 references

The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

0 references

The time-dependent prize-collecting arc routing problem

0 references

The time-dependent quickest path problem: properties and bounds

0 references

Arc Routing

0 references

Shortest paths in piecewise continuous time-dependent networks

0 references

Time-dependent SHARC-routing

0 references

Time-dependent route planning

0 references

Time dependent vehicle routing problem with a multi ant colony system

0 references

A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling

0 references

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

0 references

Approximation algorithms for time-dependent orienteering.

0 references

Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

0 references

A lower bound for the quickest path problem

0 references

A classification of formulations for the (time-dependent) traveling salesman problem

0 references

A dynamic vehicle routing problem with time-dependent travel times

0 references

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows

0 references

The moving-target traveling salesman problem

0 references

Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems

0 references

Efficient modeling of travel in networks with time-varying link speeds

0 references

Vehicle dispatching with time-dependent travel times

0 references

Vehicle routing under time-dependent travel times: the impact of congestion avoidance

0 references

A network-consistent time-dependent travel time layer for routing optimization problems

0 references

Vehicle routing with stochastic time-dependent travel times

0 references

Vehicle routing and scheduling with time-varying data: a case study

0 references

Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms

0 references

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

0 references

Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks

0 references

Least possible time paths in stochastic, time-varying networks.

0 references

An integer programming approach for the time-dependent TSP

0 references

Bidirectional \(A^*\) search on time-dependent road networks

0 references

Ranking paths in stochastic time-dependent networks

0 references

Minimal Time Vessel Routing in a Time-Dependent Environment

0 references

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

0 references

A review of dynamic vehicle routing problems

0 references

Vehicle routing and scheduling with dynamic travel times

0 references

Finding least fuel emission paths in a network with time-varying speeds

0 references

Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem

0 references

The time-dependent traveling salesman problem

0 references

A way to optimally solve a time-dependent vehicle routing problem with time windows

0 references

A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine

0 references

Motion planning among time dependent obstacles

0 references

Arc routing problems with time-dependent service costs

0 references

Vehicle routing problem with stochastic travel times including soft time windows and service costs

0 references

The dynamic shortest path problem with anticipation

0 references

Vehicle Routing

0 references

Vehicle routing with dynamic travel times: a queueing approach

0 references

Empirical validation of a queueing approach to uninterrupted traffic flows

0 references

Q4715981

0 references

A fast solution method for the time-dependent orienteering problem

0 references

Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

0 references

Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery

0 references

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights

0 references

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

0 references

Identifiers

zbMATH Open document ID

1349.90164

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.COR.2015.06.001

0 references

Sitelinks

Mathematics(1 entry)

mardi Time-dependent routing problems: a review