文档介绍：Chapter 2
CLASSIFICATION OF DYNAMIC VEHICLE
ROUTING SYSTEMS
Allan Larsen1, Oli . Madsen1 and Marius M. Solomon2
1Centre for Traffic and Transport, Technical University of Denmark, Bygningstorvet,
DK-2800 Kongens Lyngby, Denmark ; 2Department of Management Sciences, College of
Business Administration, Northeastern University, 314 Hayden Hall, 360 Huntington Avenue,
Boston, Massachusetts 02115
Abstract: This chapter discusses important characteristics seen within dynamic vehicle
routing problems. We discuss the differences between the traditional static
vehicle routing problems and its dynamic counterparts. We give an in-depth
introduction to the degree of dynamism measure which can be used to classify
dynamic vehicle routing systems. Methods for evaluation of the performance
of algorithms that solve on-line routing problems are discussed and we list
some of the most important issues to include in the system objective. Finally,
we provide a three-echelon classification of dynamic vehicle routing systems
based on their degree of dynamism and the system objective.
Key words: degree of dynamism, dynamic vehicle routing, competitive analysis
INTRODUCTION
The vehicle routing problem (VRP) has received an immense attention from
the munity during the last three to four decades as it often play
a vital role in the design of distribution systems. Basically, the VRP consists
of designing routes for a set of capacitated vehicles that are to service a set
of geographically dispersed customers at the least cost. In real-life contexts
restrictions such as time windows for when the service mence make
up important side-constraints to the problem. The basic VRP deals with
customers who are known in advance to the planning process. Furthermore,
all other information such as the driving time between the customers and the
service times at the customers are used to be known prior to the planning.
20 A. Larsen, .