Vehicle scheduling in port automation : advanced algorithms for minimum cost flow problems

著者

    • Rashidi, Hassan
    • Tsang, Edward

書誌事項

Vehicle scheduling in port automation : advanced algorithms for minimum cost flow problems

Hassan Rashidi, Edward Tsang

CRC Press, c2016

2nd ed

大学図書館所蔵 件 / 全1件

この図書・雑誌をさがす

注記

Includes bibliographical references (p. [213]-225) and index

内容説明・目次

内容説明

Container terminals are constantly being challenged to adjust their throughput capacity to match fluctuating demand. Examining the optimization problems encountered in today's container terminals, Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, Second Edition provides advanced algorithms for handling the scheduling of automated guided vehicles (AGVs) in ports. The research reported in this book represents a complete package that can help readers address the scheduling problems of AGVs in ports. The techniques presented are general and can easily be adapted to other areas. This book is ideal for port authorities and researchers, including specialists and graduate students in operation research. For specialists, it provides novel and efficient algorithms for network flow problems. For students, it supplies the most comprehensive survey of the field along with a rigorous formulation of the problems in port automation. This book is divided into two parts. Part one explores the various optimization problems in modern container terminals. The second part details advanced algorithms for the minimum cost flow (MCF) problem and for the scheduling problem of AGVs in ports. The book classifies optimization problems into five scheduling decisions. For each decision, it supplies an overview, formulates each of the decisions as constraint satisfaction and optimization problems, and then covers possible solutions, implementation, and performance. The book extends the dynamic network simplex algorithm, the fastest algorithm for solving the minimum cost flow problem, and develops four new advanced algorithms. In order to verify and validate the algorithms presented, the authors discuss the implementation of the algorithm to the scheduling problem of AGVs in container terminals.

目次

Introduction. Problems in Container Terminals. Formulations of the Problems and Solutions. Vehicle Scheduling: A Minimum Cost Flow Problem. Network Simplex: The Fastest Algorithm. Network Simplex Plus: Complete Advanced Algorithm. Dynamic Network Simplex: Dynamic Complete Advanced Algorithm. Greedy Vehicle Search: An Incomplete Advanced Algorithm. Multi-Load and Heterogeneous Vehicle Scheduling: Hybrid Solutions. Conclusions and Future Research. Appendix: Information on the Web.

「Nielsen BookData」 より

詳細情報

ページトップへ