Shortest path problems with left-side time windows
type: Item
instance of: scholarly article
title: Shortest path problems with left-side time windows
zbMATH Open document ID: 1258.90102
author: Tongquan Zhang
author: Ying Yin
author: Jianping Li
published in: Optimization Letters
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6119209
zbMATH Keywords: shortest path problem
zbMATH Keywords: travelling cycle
zbMATH Keywords: left-side time windows
zbMATH Keywords: multi-left-side time windows
MaRDI profile type: Publication
full work available at URL: s11590-011-0390-3
OpenAlex ID: W2006799493
cites work: The selection and scheduling of telecommunication calls with time windows
cites work: A constraint programming approach to the Chinese postman problem with time windows
cites work: An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
cites work: GRASP with a new local search scheme for vehicle routing problems with time windows
cites work: Finding the first \(K\) shortest paths in a time-window network.
cites work: Visiting a network of services with time constraints.
cites work: Vehicle routing and scheduling with dynamic travel times
cites work: Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
cites work: The multiple TSP with time windows: vehicle bounds based on precedence graphs
cites work: Shortest path problems with time windows on nodes and arcs
cites work: Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
cites work: Time-constrained Chinese postman problems
cites work: Finding \(K\) shortest looping paths with waiting time in a time--window network
DOI: 10.1007/S11590-011-0390-3
Recommended article: Shortest path problems with time windows on nodes and arcs
Recommended article: Shortest path tour problem with time windows
Recommended article: Q4375808
Recommended article: A generalized shortest path tour problem with time windows
Recommended article: An improving dynamic programming algorithm to solve the shortest path problem with time windows
Recommended article: A reoptimization algorithm for the shortest path problem with time windows
Recommended article: Solving the \(k\)-shortest path problem with time windows in a time varying network
Recommended article: Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
Recommended article: A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
Recommended article: Time-varying shortest path problems with constraints
description: scientific article; zbMATH DE number 6119209