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
Dissertation

Optimization of a multi-objective-multi period traveling salesman problem with pickup and delivery using genetic algorithm

TL;DR: This study aims at proposing a new extension of TSP which is ‘multi-objective-multi-period Travelling Salesman Problem with pickup and delivery’ to represent the problem and illustrating the validity and practicality of the proposed model for different strategies in a company according to its customer’s expectation.
Book ChapterDOI

Planning and Scheduling Staff Duties by Goal Programming

TL;DR: In this article, goal programming (GP) models for an integrated problem of staff duties planning and scheduling, for baggage services section staff at the Hong Kong International Airport, were proposed, where the problem is solved via its decomposition into a GP planner, followed by a GP scheduler.
Book ChapterDOI

Recent Advances in Routing Algorithms

TL;DR: In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem, including some polyhedral results and related branch and cut algorithms, new relaxations, generalized insertion algorithms, and tabu search methods.
Proceedings ArticleDOI

Optimal single probe traversal algorithm for testing of MCM substrate

TL;DR: An algorithm for finding the optimal traversal route of a single probe to test MCM interconnects is presented and shows that up to 50% reduction in probe traversal time can be obtained with this technique.
Book ChapterDOI

Routing Solutions for the Service Industry

TL;DR: The goal of this chapter is to provide the reader with the background, mathematical model and various solution approaches on one of the more commonly encountered variant of the problem, namely the VRP with Time Windows (VRPTW).