Seaside Operations Planning in Container Terminals (eBook)

Acknowledgments 5
Contents 6
List of Figures 9
List of Tables 11
Notations 13
Abbreviations 16
1 Introduction 17
1.1 Motivation and Scope of Research 17
1.2 Outline 19
2 Maritime Container Transport 21
2.1 A Brief History 21
2.2 Organization of Container Transports 23
2.3 Layout and Technical Equipment of a Container Terminal 26
2.3.1 Quay Area and Quay Cranes 27
2.3.2 Transport Area and Transport Vehicles 28
2.3.3 Yard Area and Yard Cranes 30
2.3.4 Truck and Train Area 31
3 Operational Planning Problems 32
3.1 Distinction of Planning Levels 32
3.2 Seaside Operations Planning 3.2.1 Berth Allocation 33
3.2.2 Quay Crane Assignment 36
3.2.3 Quay Crane Scheduling 38
3.2.4 Stowage Planning 39
3.3 Internal Operations Planning 3.3.1 Yard Management 40
3.3.2 Yard Crane Scheduling 41
3.3.3 Horizontal Transport 42
3.4 Landside Operations Planning 43
3.5 Workforce Planning 44
4 RelatedWork on Seaside Operations Planning 46
4.1 RelatedWork on the BAP and the QCAP 4.1.1 Classification Scheme 46
4.1.2 Problem Classification 48
4.2 RelatedWork on the QCSP 4.2.1 Classification Scheme 54
4.2.2 Problem Classification 55
4.3 Related OR Problems 59
5 Integration Concepts for Seaside Operations Planning 62
5.1 Sequential Solution 62
5.2 Integration Concepts in the Literature 65
5.3 Designing a Comprehensive Integration Concept 67
6 Berth Allocation and Quay Crane Assignment 70
6.1 Modeling the BACAP 6.1.1 Problem Description and Assumptions 70
6.1.2 Resource Utilization 71
6.1.3 Cost Structure 73
6.1.4 OptimizationModel 74
6.2 Solution Methods 76
6.2.1 Construction Heuristic 76
6.2.2 Local Refinements 79
6.2.3 Meta-heuristics 82
6.2.4 Specific Quay Crane Assignment 85
6.3 Computational Study 85
6.4 Summary 97
7 Quay Crane Scheduling 99
7.1 Modeling the QCSP 7.1.1 Problem Description and Assumptions 99
7.1.2 Conventional Formulation of Interference Constraints 100
7.1.3 Corrected Formulation of Interference Constraints 103
7.1.4 OptimizationModel 105
7.2 Unidirectional Scheduling Heuristic 7.2.1 Idea and Outline 108
7.2.2 Assignment of Tasks to Cranes 110
7.2.3 Sequencing of Tasks 113
7.2.4 Scheduling of Tasks 114
7.3 The QCSP with TimeWindows 117
7.3.1 Declaration of Time Windows for Cranes 117
7.3.2 OptimizationModel 121
7.3.3 Adaptation of the UDS Heuristic 121
7.4 Computational Study 123
7.5 Summary 131
8 Integration of Quay Crane Scheduling into the BACAP 133
8.1 Idea and Outline 133
8.2 Preprocessing Phase 135
8.2.1 Deriving Crane Utilization Rates 136
8.2.2 Applying Crane Utilization Rates Within the BACAP 138
8.3 Feedback Loop Phase 140
8.3.1 Postprocessing of a QCSPTW 140
8.3.2 Reinstalling Quay Crane Schedules 142
8.3.3 Repairing Infeasible BACAP Solutions 145
8.4 Computational Study 148
8.5 Summary 156
9 Conclusions 157
A.1 The Berth Allocation and Crane Assignment Model of Park and Kim ( 2003) 160
B.1 Pseudocodes 162
C.1 A Lower Bound for the QCSP 169
D.1 A Lower Bound for the QCSPTW 171
Bibliography 172