Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, 2/e(Hardcover)
暫譯: 港口自動化中的車輛排程:最小成本流問題的進階演算法,第二版(精裝本)
Hassan Rashidi, Edward Tsang
- 出版商: CRC
- 出版日期: 2015-08-14
- 售價: $5,450
- 貴賓價: 9.5 折 $5,178
- 語言: 英文
- 頁數: 259
- 裝訂: Hardcover
- ISBN: 1498732534
- ISBN-13: 9781498732536
-
相關分類:
Algorithms-data-structures
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$450$405 -
$1,500$1,470 -
$680$537 -
$680$537 -
$580$452 -
$560$476 -
$590$460 -
$520$411 -
$2,080$2,038 -
$653$614 -
$990Blockchain: A Practical Guide to Developing Business, Law, and Technology Solutions
-
$580$458 -
$4,730$4,494 -
$420$331 -
$750$592 -
$528$502
相關主題
商品描述
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.
商品描述(中文翻譯)
容器碼頭不斷面臨調整其吞吐能力以匹配波動需求的挑戰。針對當今容器碼頭所遇到的優化問題,港口自動化中的車輛排程:最低成本流問題的進階演算法,第二版提供了處理自動引導車輛(AGVs)在港口排程的進階演算法。
本書報告的研究代表了一個完整的方案,可以幫助讀者解決港口中AGVs的排程問題。所提出的技術是通用的,並且可以輕鬆適應其他領域。
本書非常適合港口當局和研究人員,包括運籌學專家和研究生。對於專家來說,它提供了針對網路流問題的新穎且高效的演算法。對於學生來說,它提供了該領域最全面的調查以及對港口自動化問題的嚴謹表述。
本書分為兩個部分。第一部分探討現代容器碼頭中的各種優化問題。第二部分詳細介紹最低成本流(MCF)問題和港口中AGVs的排程問題的進階演算法。
本書將優化問題分類為五個排程決策。對於每個決策,它提供概述,將每個決策表述為約束滿足和優化問題,然後涵蓋可能的解決方案、實施和性能。
本書擴展了動態網路單純形演算法,這是解決最低成本流問題的最快演算法,並開發了四個新的進階演算法。為了驗證和確認所提出的演算法,作者討論了將該演算法應用於容器碼頭AGVs排程問題的實施。