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

Vehicle Routing Problem with Fuzzy Due-Time Using Genetic Algorithms

TL;DR: The concept of fuzzy due-time is suggested to use to replace the concept of time window because it can describe customers preference better than fixed time-window.
Journal ArticleDOI

A capacitated vehicle routing problem for just-in-time delivery

TL;DR: In this paper, the authors focus on the formulation and solution of the problem of planning vehicle routes for material delivery within the premises of a plant working under a just-in-time production system, where the quantity to be delivered at each of the demand nodes is a function of the route taken by the vehicle assigned to serve that node.
Journal ArticleDOI

Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design

TL;DR: In this paper, two heuristics were developed to find a route for each daily set of stops that satisfied all the requirements and minimized the total distance flown, and a significant reduction of total daily flying time has been achieved.
Journal ArticleDOI

Optimization of printed circuit board manufacturing: Integrated modeling and algorithms

TL;DR: This paper examines the problems of allocating the components to feeders and sequencing the placement of these components on the PCBs, populated by a rotary head machine with surface mount technology and presents a solution with an e-error gap for the PCB problem.
Journal ArticleDOI

An open vehicle routing problem metaheuristic for examining wide solution neighborhoods

TL;DR: An innovative local search metaheuristic which examines wide solution neighborhoods in the open vehicle routing problem (OVRP) by storing static move descriptor entities in Fibonacci heaps and employing a tabu scheme and a penalization strategy both compatible with the SMD design.