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
Book ChapterDOI

Route Optimization Algorithms for Expert Systems

Freimut Hillert
TL;DR: For maximization of a weight function over a system of indepedent sets a new type of algorithm had been found that addressed the problem of maximizing the number of sets in a discrete-time model.
Journal ArticleDOI

Weighted Hamiltonian augmentation method involving insertions

Roy W. Dahl, +5 more
- 01 Oct 1988 - 
TL;DR: This paper presents an algorithm designed to solve the AIAA Artificial Intelligence Design Challenge, a stochastic generalization of the traveling salesman problem in which travel costs can incur a penalty with a given probability.
Journal ArticleDOI

Optimization under uncertainty with applications to personnel management problems in tourism

Nicholas A. Nechval, +3 more
TL;DR: In this paper, a new technique of invariant embedding of sample statistics in a performance index is proposed, which represents a simple and computationally attractive statistical method based on the constructive use of the invariance principle in mathematical statistics and allows one to eliminate unknown parameters from the problem and to find the best invariant decision rule, which has smaller risk than any of the well-known decision rules.
Posted Content

Structure and temporal evolution of transportation literature.

Milad Haghani, +1 more
- 27 Jul 2021 - 
TL;DR: In this article, the authors revisited the evolution of the transportation field at a macro scale using scientometric analysis of all publications in all 39 journals indexed in the category of Transportation by the Web of Science.
Book ChapterDOI

Vehicle Scheduling Problem on Trees

Jie Zhou, +5 more
TL;DR: This paper shows that this problem is NP-hard, and gives a pseudo polynomial time algorithm for this problem, and shows that the total value of the completed tasks are maximized.