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

TASTE: a two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up

TL;DR: In this article, the traveling salesman problem with simultaneous delivery and pick-up (TSDP) was considered and a mathematical programming model and a two-phase heuristic was developed to solve the TSDP.
Journal ArticleDOI

On the impact of real-time information on field service scheduling

TL;DR: This paper compares online and offline heuristics as well as hybrids to solve the field force scheduling problem with priorities and the results help understand the benefits of dynamic scheduling based on real-time position information as compared to traditional daily offline planning.
Journal ArticleDOI

Vehicle routing problem and its solution methodologies: a survey

TL;DR: This paper presents survey of some of the recently employed solution methodologies in the field of vehicle routing problem (VRP) and its variants and presents some future possibilities in VRP.
Journal ArticleDOI

The Vertex Coloring Problem and its generalizations

TL;DR: This work deals with the Vertex Coloring Problem and its generalizations, for which models, bounds and algorithms are proposed and a Routing Problem in telecommunication networks where not only the efficiency, but also the fairness of the solution is considered.
Journal ArticleDOI

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

TL;DR: A novel mathematical programming formulation which combines ideas from known models, and an exact solution procedure based on branch-and-price is presented, which provides suboptimal schedules using limited computational resources.