scispace - formally typeset
Open AccessJournal Article

Routing and scheduling of vehicles and crews–the state of the art

L. Bodin
- 01 Jan 1983 - 
- Vol. 10, Iss: 2, pp 69-211
About: 
This article is published in Computers & Operations Research.The article was published on 1983-01-01 and is currently open access. It has received 1046 citations till now. The article focuses on the topics: Static routing & Policy-based routing.

read more

Citations
More filters
Journal ArticleDOI

A comparison of five heuristics for the multiple depot vehicle scheduling problem

Ann-Sophie Pepin, +3 more
- 01 Feb 2009 - 
TL;DR: In this article, the authors compare the performance of five different heuristics for multi-depot vehicle scheduling problem, namely, a truncated branch-and-cut method, a Lagrangian heuristic, the truncated column generation method, the large neighborhood search heuristic (LNS), a truncation column generation for neighborhood evaluation, and a tabu search algorithm, and show that column generation heuristic performs the best when enough computational time is available and stability is required.
Journal ArticleDOI

An Interactive Algorithm for Vehicle Routeing for Winter - Gritting

Leon Y. O. Li, +1 more
- 01 Feb 1996 - 
TL;DR: A heuristic algorithm is devised with a computer program which allows user-interaction, and provides a practical tool for planning gritter routes and test results from the interactive algorithm are found to outperform another existing approach which solves the same problem.
Journal ArticleDOI

Algorithms for the quickest path problem and the enumeration of quickest paths

J. B. Rosen, +2 more
- 01 Sep 1991 - 
TL;DR: An alternative algorithm for the single pair quickest path problem with same time complexity and less space requirement is developed and an algorithm to enumerate the first m quickest paths to send a given amount of data with time complexity O(rmne + rmn2 log n) time is developed.
Journal ArticleDOI

Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints

Ali Haghani, +1 more
- 01 May 2002 - 
TL;DR: The route time constraints are added to the MDVS problem to account for the real world operational restrictions such as fuel consumption and this formulation decreases the size of the problem by about 40% without eliminating any feasible solution.
Journal ArticleDOI

Scheduling dial-a-ride paratransit under time-varying, stochastic congestion

Liping Fu
- 01 Jul 2002 - 
TL;DR: In this paper, a dial-a-ride scheduling problem arising in paratransit service systems that are subject to tight service time constraints and time-varying, stochastic traffic congestion is discussed.