Planning and Operation of Container Terminals / Kap Hwan Kim.

Format:

Book

Author/Creator:

Kim, Kap Hwan, author.

Language:

English

Subjects (All):

Cargo handling.

Physical Description:

1 online resource (476 pages)

Edition:

First edition.

Place of Publication:

Amsterdam, Netherlands : Elsevier Inc., [2024]

Summary:

Planning and Operation of Container Terminals provides methodologies to optimize the design of container handling systems.The book offers various optimization models and details how to apply the models.In addition, it captures key points of academic research to provide a thorough and up-to-date guide on this rapidly changing field.

Contents:

Front Cover

Planning and Operation of Container Terminals

Copyright

Contents

Preface

1 - Facilities, handling processes, and automation

1. Introduction

2. Handling activities and facilities

3. Automations in container terminals

4. Performance measures of container terminals

References

2 - Facilities planning

1. Design procedure

1.1 Introduction

1.2 Container flows

1.3 Design procedure

1.3.1 Input data collection

1.3.2 Estimating capacity requirements

1.3.3 Alternative design

1.3.4 Alternative evaluation

1.3.5 Selection of the best alternative

1.4 Summary

2. An illustrative estimation of capacity requirements

2.1 Quay side capacity

2.2 Container throughput requirements by the type of flow

2.3 Gate capacity

2.4 Yard storage requirements

2.4.1 Yard dimensioning

2.5 Yard crane requirements

2.6 Estimated turnaround times

3. Statistical analysis on space requirements of container storage yard

4. A case study on the layout of a rail terminal in a container port

4.1 Introduction

4.2 Description of rail terminals

4.3 Procedure and issues for designing rail terminals

4.3.1 Performance requirements of rail terminals

4.3.2 Formulas for determining values of design parameters

4.3.3 Facility layout planning

3 - Designing a storage yard

1. Estimating the operational cycle time of yard cranes

1.1 Basic elements of an operational cycle

1.2 Derivation of expected values and variances in the cycle time for various operational types

2. Optimal design of a block

2.1 Various models for optimizing the block size

2.2 Minimizing the weighted sum of the expected cycle times of a YC subject to a constraint on the minimum block storage capacity.

2.3 Maximizing the storage capacity subject to a constraint on the longest weighted sum of the expected cycle times

2.4 Minimizing the weighted expected truck waiting time subject to a constraint on the minimum block storage capacity

2.5 Maximizing the storage capacity subject to a constraint on the longest expected truck waiting time

2.6 Numerical experiments

2.7 Summary

3. Simulation study for finding the optimal layout

3.1 Terminal configuration and input data

3.2 Comparison of the performance across different layouts

3.3 Summary

4. Rehandling in container yards

4.1 Container rehandling when picking up a single container

4.1.1 Introduction

4.1.2 Random retrieval of a single container

4.1.2.1 Number of handlings required with a gantry crane

4.1.2.2 Number of handlings required with a top handler

4.1.3 Flexible retrieval of a single container

4.2 Retrieving all the containers in a random sequence from a bay with a gantry crane

4.2.1 Exact method for calculating the expected number of rehandles to pick up all the containers from a bay

4.2.2 Approximated formula for the expected total number of rehandles when retrieving all the containers from a bay randomly

Appendix A. Expectation and variance of Max(Tt∗rr

Tg∗rc), Max(Tt∗rr

Tg∗cr) describing movements of a YC

4 - Overview of operation planning and control

1. Resource and operation planning in container terminals

1.1 Berth planning

1.2 Vessel operation planning

1.3 Yard space planning and storage location assignment

2. Real-time scheduling for YCs and transporters

3. Conclusions

5 - Berth and ship operation scheduling

1. Berth allocation and continuous berth scheduling

1.1 Berth allocation

1.2 Continuous berth scheduling

2. Quay crane work scheduling

2.1 Introduction.

2.2 A constructive heuristic algorithm

2.3 A mathematical formulation for QC work scheduling

2.4 Concluding remarks

3. Load sequencing

3.1 Introduction

3.2 Problem definition of the load sequencing

3.3 Finding the preferable loading sequence of slots on a vessel

3.4 Simultaneous sequencing containers and slots

3.5 Dual command cycling of QC

3.5.1 Two machine flow shop scheduling

3.5.1.1 Implementing Johnson's rule

3.5.2 Dual command cycling of QC

4. Conclusions

Appendix 1: Theories for parallel machine scheduling problems

A1 Minimizing the make-span

A2 Minimizing the total flow-time

Appendix 2: A QC work scheduling procedure using GRASP (Kim &amp

Park, 2004)

Solution construction phase (phase 1)

Solution improvement phase (phase 2)

The stopping criteria

A numerical experiment

6 - Planning storage activities

1. Strategies for managing storage yards

1.1.1 Performance measures, design parameters, and rules for container storages

1.1.2 Designation of storage areas to a specific type of containers (DESIG)

1.1.3 Reservation unit (UNIT)

1.1.4 Different priorities on blocks for different berths (PRIOBERTH)

1.1.5 Number of locations for reserved spaces (NUMRESERVE)

1.1.6 Sequencing bays or stacks to reserve (SEQUENCE)

1.1.7 Maximum number of internal trucks and road trucks in a block (MAXVEH)

1.2 Simulation experiment

1.2.1 Performance measures and storage rules

1.2.2 Comparison of the performance of the DESIG storage rules

1.2.3 Comparison of the performance of the UNIT storage rules

1.2.4 Comparison of the performance of the PRIOBERTH storage rules

1.2.5 Comparison of the performance of the NUMRESERVE storage rules

1.2.6 Comparison of the performance of the SEQUENCE storage rules.

1.2.7 Comparison of the performance of the MAXVEH storage rules

1.3 Conclusions

2. Storage space planning

2.1 Storage space usage planning in a port area

2.2 Dynamic storage space allocation to storage requirements-operational decision-making problem

3. An integrated operation planning framework and storage space planning

3.2 Framework for a planning procedure

3.3 Storage space planning considering workload on various resources

4. Optimizing storage space plans considering the workload

4.1 A mathematical formulation

4.2 Numerical example and sensitivity analysis for the YP model

4.2.1 Layout and resources

4.2.2 Estimating the capacities of and requirements for resources

4.2.3 The arrivals and departures of containers in the yard

4.2.4 Results of numerical experiments

4.2.5 Sensitivity analysis of weights

4.2.5.1 Effect of integrality constraints on the solution quality

4.3 Discussions and conclusions

7 - Real-time locating, relocating, and re-marshalling containers

1. Locating arriving containers into specific slots in the yard

2. Locating loading containers considering their weights

2.1 Introduction

2.2 Development of the optimization model

2.2.1 Optimizing method

2.2.2 Heuristic rules

3. Locating rehandled containers

3.2 A branch and bound algorithm

3.2.1 Cases with precedence relationships among individual containers

3.2.2 Cases with precedence relationships among groups of containers

3.3 A heuristic for the case with precedence relationships among individual containers

8 - Managing storage space demand

1. Managing storage space demand by the storage charge of containers

1.1 Price scheduling for outbound containers

1.1.1 Introduction.

1.1.2 Storage charge, space utilization, and productivity of ship operations

1.1.3 Price scheduling

1.1.3.1 Maximizing terminal profit

1.1.3.2 Minimizing total system cost

1.2 Price scheduling for inbound containers

1.2.1 Model for maximizing the profit of the terminal

1.2.2 Public terminal operators minimizing the total cost of the system

2. Scheduling the remarshaling operation

2.2 Mathematical formulation

2.2.1 Numerical experiments

9 - Transport systems

1. Various decision-making problems related to transport systems

2. Guide path design

2.1 Problem definition

3. Dispatching of vehicles

3.1 Various strategies for dispatching transporters in container terminals

3.2 One-to-many dispatching rules

3.2.1 Illustrative examples of one-to-many dispatching rule

3.2.1.1 Shortest travel distance rule

3.2.1.2 Minimum deployment rule

3.2.1.3 Priority-based rules

3.3 Many-to-many dispatching rules

3.3.1 Cost-based many-to-many assignment

3.3.1.1 Time-based many-to-many assignment

3.3.1.2 Inventory-based many-to-many assignment

3.3.2 Delay-first many-to-many assignment

4. Routing automated guided vehicles

4.2 AGV guide path network and the routing problem

4.3 Application of the Q-learning technique for routing AGVs

4.4 Simulation study

4.4.1 Simulation scenario

4.4.2 Simulation results

4.5 Discussions

5. Deadlock resolution and avoidance

5.1 Introduction

5.2 Deadlock between an AGV and a crane

5.2.1 Cases of deadlock

5.2.2 Deadlock resolution

5.3 Deadlock among AGVs

5.3.1 Comparing various strategies for handling deadlocks among transporters

5.3.1.1 Random horizontal lane (RHL) rule

5.3.1.2 Workload distribution (WD) rule.

5.3.1.3 Maximum No transporter in a loop (MNFL) rule.

Notes:

Includes bibliographical references and index.

Description based on print version record.

Description based on publisher supplied metadata and other sources.

ISBN:

0-443-13824-9

OCLC:

1419055723