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

Solving vehicle routing problems using an enhanced clarke-wright algorithm: a case study

Buyang Cao
TL;DR: This paper presents a business scenario requiring VRP solutions, and proposes an enhanced Clarke and Wright algorithm that aims at eliminating the human interventions such as parameter setting and tuning during the problem solving procedures.
Journal ArticleDOI

Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm

Ademir Aparecido Constantino, +5 more
- 28 May 2017 - 
TL;DR: A deterministic 2-phase heuristic algorithm is proposed using multiple assignment problems that arise from a model based on a weighted multipartite graph that indicates that the proposed approach is competitive to solve large BDSP.
Journal ArticleDOI

A method to evaluate routing policy through p minimal paths for stochastic case

Yi-Kuei Lin
- 01 Dec 2010 - 
TL;DR: A stochastic-flow network is presented to model a computer network in which each arc has various possible capacities and may fail and an efficient solution procedure is proposed to calculate transmission reliability.
Journal ArticleDOI

Different versions of the savings method for the time limited vehicle routing problem

Petr Kučera
- 01 Jan 2012 - 
TL;DR: Several different versions of the famous savings method by Clark and Wright (1964) for the time limited vehicle routing problem are suggested, test them in some instances, and evaluate and mutually compare the results of individual versions.
Proceedings ArticleDOI

Formulating the steel scheduling problem as a TSPTW

Chen Xiong, +1 more
TL;DR: In this paper, a traveling salesman problem with time windows (TSPTW) of combinational optimization is adopted to analyse and model the problem of optimal steel production sequencing through the milling process of a large manufacturing facility.