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

Performance indicator evaluation for a cloud computing system from QoS viewpoint

Yi-Kuei Lin, +1 more
- 01 Jan 2013 - 
TL;DR: In order to measure the service level of a CCS, this paper constructs a network model and proposes a key performance indicator (KPI), where the KPI is utilized to evaluate the probability that the demand can be satisfied under both transmission time and maintenance budget constraints.
Journal ArticleDOI

Zone skipping vs. direct shipment of small orders: integrating order processing and optimization

Lori S. Franz, +1 more
- 01 Jun 1993 - 
TL;DR: An easy to use and maintain system is designed which merges transaction processing and modeling to solve the zone skipping problem and the advantages of the specific integer linear programming algorithm used in this system are discussed.
Journal ArticleDOI

Using object-oriented paradigm to develop an evolutional vehicle routing system

Timon C. Du, +1 more
- 01 Apr 2001 - 
TL;DR: This study adopts a component assembly model to develop an evolutional system development process including database schema evolution, application object reuse, and the integration.
Book ChapterDOI

New Heuristic Algorithms for the Crew Scheduling Problem

Luís Cavique, +2 more
TL;DR: This paper describes the implementation of two Tabu search based algorithms for the Crew Scheduling Problem, formulated as the minimal number of duties necessary to cover a predefined timetable under contractual rules which excludes the possibility of resorting to extra-time.
Journal ArticleDOI

Transmission reliability of k minimal paths within time threshold

Yi-Kuei Lin
- 01 Nov 2011 - 
TL;DR: A simple algorithm is proposed to generate all lower boundary points for (d,T), the minimal system states satisfying the demand within time threshold T, and another algorithm is further proposed to find the optimal combination of k minimal paths with highest transmission reliability.