Vehicle dispatching with time-dependent travel times
type: Item
instance of: scholarly article
title: Vehicle dispatching with time-dependent travel times
zbMATH Open document ID: 1012.90003
DOI: 10.1016/S0377-2217(02)00147-9
author: Soumia Ichoua
author: Michel Gendreau
author: Jean-Yves Potvin
published in: European Journal of Operational Research
publication date: 2003-04-10T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1896733
zbMATH Keywords: transportation
zbMATH Keywords: vehicle routing
zbMATH Keywords: time-dependent
zbMATH Keywords: tabu search
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q4834367
cites work: The shortest route through a network with time-dependent internodal transit times
cites work: Commuters' Paths with Penalties for Early or Late Arrival Time
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
cites work: Q4354785
cites work: Q5569992
cites work: Shortest route with time dependent length of edges and limited delay possibilities in nodes
cites work: Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks
cites work: Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
cites work: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Time depending shortest-path problems with applications to railway networks
cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
cites work: A computer assistant for vehicle dispatching with learning capabilities
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
full work available at URL: s0377-2217(02)00147-9
OpenAlex ID: W2088769880
Recommended article: Vehicle routing and scheduling with dynamic travel times
Recommended article: Vehicle routing with stochastic time-dependent travel times
Recommended article: A dynamic vehicle routing problem with time-dependent travel times
Recommended article: Vehicle routing and scheduling with time windows
Recommended article: Q4889094
Recommended article: Vehicle Routing with Time Windows
Recommended article: Vehicle routing with dynamic travel times: a queueing approach
Recommended article: Q3306941
Recommended article: Vehicle routing with arrival time diversification
Recommended article: The vehicle routing problem with time windows and temporal dependencies
description: scientific article; zbMATH DE number 1896733