Meyer Vehicle Routing under Consideration of Driving and Working Hours

A Distributed Decision Making Perspective
1. Auflage 2011
ISBN: 978-3-8349-6732-9
Verlag: Betriebswirtschaftlicher Verlag Gabler
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 152 Seiten, Web PDF

Reihe: Produktion und Logistik

In April 2007 new legal rules concerning the driving and working hours of truck drivers have become valid in all member countries of the European Union. In the study of Christoph Manuel Meyer the dispatchers’ problem of combined vehicle routing and break scheduling is modelled and solved using an efficient heuristic solution algorithm. Special attention is given to the distributed decision competences between dispatchers and drivers, which are usually encountered in practice. Finally, strategies for including the legal rules in the dispatching process are suggested, which can easily be implemented by freight forwarding companies in practice.

Zielgruppe

Research

Autoren/Hrsg.

Meyer, Manuel

Inhaltsverzeichnis

1;Foreword;6
2;Preface;8
3;Contents;10
4;List of Figures;13
5;List of Tables;14
6;Abbreviations;15
7;1 Introduction;16
7.1;1.1 Problem Description;17
7.2;1.2 Related Literature;18
7.3;1.3 Objectives and Structure of the Thesis;21
8;2 European Legislation on Driving and Working Hours in Road Transportation;23
8.1;2.1 Regulation (EC) No 561/2006 on Driving Hours;23
8.1.1;2.1.1 Scope;24
8.1.2;2.1.2 Definitions;25
8.1.3;2.1.3 Restrictions on Driving Hours;26
8.1.4;2.1.4 Documentation of Driving Times;28
8.1.5;2.1.5 Comparison Between Current and Former European Legislation on Driving Hours;30
8.2;2.2 Directive 2002/15/EC on Working Hours;34
8.2.1;2.2.1 Scope;34
8.2.2;2.2.2 Definitions;35
8.2.3;2.2.3 Restrictions on Working Hours;35
8.2.4;2.2.4 Implementation into German Legislation;36
8.3;2.3 Remarks on the General Structure of the European Social Legislation;36
8.4;2.4 Control Policies;37
9;3 Dispatchers’ Tasks in Combined Vehicle Routing and Break Scheduling;39
9.1;3.1 The Dispatching Process;39
9.2;3.2 The Impact of the European Social Legislation on the Dispatching Process;41
9.2.1;3.2.1 Effects on Vehicle Routing and Scheduling;42
9.2.2;3.2.2 Examples of Effects;43
9.3;3.3 Combined Vehicle Routing and Break Scheduling in Practice;46
9.3.1;3.3.1 Methodology of the Study;46
9.3.2;3.3.2 Interviews with Freight Forwarding Companies;47
9.3.3;3.3.3 Summary of the Findings;51
10;4 Model for the Vehicle Routing Problem with Time Windows and European Social Legislation;53
10.1;4.1 Model for the VRPTW-EU with Basic Rules;54
10.1.1;4.1.1 Problem Definition;55
10.1.2;4.1.2 Notation;57
10.1.3;4.1.3 Model Formulation;59
10.2;4.2 Model for the VRPTW-EU with Optional Rules;64
10.2.1;4.2.1 Problem Definition;64
10.2.2;4.2.2 Notation;65
10.2.3;4.2.3 Model Formulation;66
10.3;4.3 Computional Experiments;72
10.3.1;4.3.1 Experimental Settings;73
10.3.2;4.3.2 Computational Results for the VRPTW-EU;74
10.3.3;4.3.3 Example of a Tour Plan;78
11;5 Distributed Decision Making in Combined Vehicle Routing and Break Scheduling;80
11.1;5.1 The Distributed Decision Making Framework;81
11.1.1;5.1.1 Classification of Distributed Decision Making Systems;82
11.1.2;5.1.2 Coordination in Distributed Decision Systems;83
11.2;5.2 The Problem of Combined Vehicle Routing and Break Scheduling as a Problem of Distributed Decision Making;86
11.2.1;5.2.1 Distribution of Tasks between Planners and Drivers;86
11.2.2;5.2.2 Anticipation of the Drivers’ Planning;89
11.3;5.3 Model Formulations;91
11.3.1;5.3.1 Driver’s Model;91
11.3.2;5.3.2 Dispatcher’s Model;96
11.3.3;5.3.3 Anticipation Functions;97
11.3.3.1;5.3.3.1 Perfect Explicit Anticipation;97
11.3.3.2;5.3.3.2 Approximate Explicit Anticipation;98
11.3.3.3;5.3.3.3 Implicit Anticipation;100
11.4;5.4 Computational Experiments for the Decentralized Approaches;101
11.4.1;5.4.1 Experimental Settings and Solution Procedure;101
11.4.2;5.4.2 Computational Results;103
11.4.2.1;5.4.2.1 Perfect Explicit Anticipation;103
11.4.2.2;5.4.2.2 Approximate Explicit Anticipation;105
11.4.2.3;5.4.2.3 Implicit Anticipation;107
11.4.3;5.4.3 Summary of the Findings;111
12;6 Restricted Dynamic Programming Heuristic for the Problem of Combined Vehicle Routing and Break Scheduling;115
12.1;6.1 Dynamic Programming Methods for Vehicle Routing Problems;115
12.1.1;6.1.1 Dynamic Programming Algorithm for the Traveling Salesman Problem;116
12.1.2;6.1.2 Restricted Dynamic Programming Algorithm for the Traveling Salesman Problem;118
12.1.3;6.1.3 Solving Vehicle Routing Problems via Giant-Tour Representations;118
12.2;6.2 Restricted Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Social Legislation;120
12.2.1;6.2.1 Basic Break Scheduling Method;122
12.2.2;6.2.2 Extended Break Scheduling Method;126
12.2.2.1;6.2.2.1 Extended Daily Driving Times;126
12.2.2.2;6.2.2.2 Reduced Daily Rest Periods;127
12.2.2.3;6.2.2.3 Split Breaks;128
12.2.2.4;6.2.2.4 Split Daily Rest Periods;129
12.2.2.5;6.2.2.5 Overview of the Implementations of the Optional Rules;130
12.2.3;6.2.3 Extensions to Different Time Horizons;131
12.2.4;6.2.4 Computational Experiments;131
12.3;6.3 Distributed Decision Making Using the Restricted Dynamic Programming Heuristic;137
12.3.1;6.3.1 Computational Experiments for the Decentralized Planning Approach;138
12.3.1.1;6.3.1.1 Team Situation;138
12.3.1.2;6.3.1.2 Non-Team Situation;142
12.3.2;6.3.2 Summary of the Findings;144
13;7 Conclusions and Further Research;146
13.1;7.1 Conclusions for Vehicle Routing Under Consideration of Driving and Working Hours;146
13.2;7.2 Outline of Further Research Directions;148
14;Bibliography;151

Über Autor(innen)

Dr. Christoph Manuel Meyer wrote his dissertation under Prof. Dr.-Ing. Herbert Kopfer’s supervision at the Chair of Logistics at the University of Bremen.