Operational Freight Carrier Planning: Basic Concepts, Optimization Models and Advanced Memetic Algorithms

Front Cover
Springer Science & Business Media, Apr 21, 2005 - Science - 164 pages
0 Reviews
This book represents the compilation of several research approaches on opera tional freight carrier planning carried out at the Chair of Logistics, University of Bremen. It took nearly three years from the first ideas to the final version, now in your hands. During this time, several persons helped me all the time to keep on going and to re-start when I got stuck in a dead end or when I could not see the wood for the trees. I am deeply indebted to them for their encouragement and comments. Prof. Dr. Herbert Kopfer, holder of the Chair of Logistics, introduced me into the field of operational transport planning. He motivated and supervised me. Furthermore, he supported me constantly and allowed me to be as free as possible in my research and encouraged me to be as creative as necessary. In addition, I have to thank Prof. Dr. Hans-Dietrich Haasis, Prof. Dr. Martin G. Mohrle and Prof. Dr. Thorsten Poddig. On behalf of all my colleagues, who supported me in numerous ways, I have to say thank you to Prof. Dr. Dirk C. Mattfeld, Prof. Dr. Christian Bierwirth, Henner Gratz, Prof. Dr. Elmar Erkens, Nadja Shigo and Katrin Dorow. They all helped me even with my most obscure and dubious problems. My family supported me all the time. They always showed me their trust and encouraged me continuously. Special thanks are dedicated to my parents Monika and Heinz-Jiirgen.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Transport in Freight Carrier Networks
1
12 Carrier Transport Networks
4
13 Network Design Configuration and Deployment
9
14 Distribution and Collection Planning
11
15 Aims of this Book and Used Methods
13
Operational Freight Transport Planning
15
21 Decision Problems
16
212 Mode Selection
17
543 CoEvolution of Partial Solutions
75
55 Conclusions
76
Memetic Search for Optimal PDSchedules
77
61 PermutationControlled Schedule Construction
78
613 Algorithm Steps
79
614 Determination of the Request Instantiation Order
84
63 Configuration of the Memetic Algorithm
85
632 Recombination
86

213 Routing
19
214 Freight Optimization
20
22 Hierarchical and Simultaneous Planning
22
222 Simultaneous Routing and Freight Optimization
23
23 Generic Models for Simultaneous Problems
24
231 MaximalProfit Selection
25
233 Selection with Compulsory Requests
26
234 Selection with Postponement
27
24 Conclusions
29
Pickup and Delivery Selection Problems
31
311 Problems with DepotConnected Requests
33
313 Simultaneous Problems
34
33 Optimization Problem
36
34 Problem Variants
37
341 The PDSP with LSP Incorporation
38
342 The Capacitated PDSP
39
344 The PDSP with Postponement
40
35 Test Case Generation
42
352 Freight Tariff
45
353 Benchmark Suites
46
36 Conclusions
48
Memetic Algorithms
49
42 Evolutionary Algorithms
52
43 Genetic Algorithms
55
432 General Framework
56
433 Applicability of Genetic Search
57
434 Limits of the Genetic Search
58
44 Repairing and Improving the Genetic Code
60
45 Conclusions
64
Memetic Algorithm Vehicle Routing
65
52 Genetic Clustering
68
53 Combined Genetic Sequencing and Clustering
71
541 MultiChromosome Memetic Algorithms
72
542 CoEvolution with Specialization
74
633 Mutation
90
634 Population Model
92
64 Computational Experiments
93
641 Parameterization of the MA
94
642 Impacts of Spatial Distribution and Time Window Tightness
97
643 Identification of ProfitMaximum Request Selections
100
644 Consideration of Capacity Limitations
102
645 Identification of Deferrable Requests
109
65 Conclusions
113
Coping with Compulsory Requests
115
71 Limits of Fitness Penalization
116
712 Dynamically Determined Penalties
118
713 Adaptive Penalization
119
72 A DoubleRanking Approach
120
73 ConvergingConstraint Approach
121
732 ACCAlgorithm Control
124
Numerical Results
125
An Example
130
75 Conclusions
133
Request Selection and Collaborative Planning
135
81 The Portfolio Recomposition Problem
136
812 Formal Problem Statement
137
82 Configuration of the Groupage System
139
821 Bundle Specification by the Carriers
140
83 Computational Experiments
141
831 Test Cases
142
833 Reference Approach
143
84 Conclusions
147
Conclusions
149
92 Model Building
150
93 Methodological Enhancements
151
References
153
Index
161
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information