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

One-to-Many Distribution with Transshipments: An Analytic Model

TL;DR: This paper presents and optimizes two cases of an approximate analytic model of distribution from a single origin to many destinations via transshipment terminals, focusing on situations in which local vehicles operate on multi-stop tours.
Journal ArticleDOI

Study on the vehicle routing problem considering congestion and emission factors

TL;DR: A time-dependent green vehicle routing problem (TD-GVRP) model with minimised total cost as the objective function which includes fuel consumption cost, and the measurement of fuel consumption is based on the Comprehensive Modal Emissions Model (CMEM).
Journal ArticleDOI

Neural networks for automated vehicle dispatching

TL;DR: An alternative neural network model is proposed as a sub-symbolic and empirical alternative for modeling the decision process of expert dispatchers and preliminary results about the ability of the network to reproduce various decision rules are reported.
Journal ArticleDOI

A new algorithm for the directed Chinese postman problem

TL;DR: An algorithm for the directed Chinese Postman Problem is presented, which can be applied directly to the original network and, compared with the existing algorithms, has a better computational complexity O ( kn 2 ) where k depends on the structure of the network.
Journal ArticleDOI

A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems

TL;DR: A hybrid adaptive large neighbourhood search algorithm to solve the MDOVRP coupled with improvement procedures yielding a hybrid metaheuristic is proposed, indicating that the proposed algorithm is very competitive compared with the state-of-the-art methods.