Rashidi and Tsang publicize their research advancing state-of-the-art algorithms in network flow problems, which they say would be useful to port authorities and to researchers including
specialists and graduate students of operations research. They begin with the optimization problems faced by today’s modern container terminals in general, then narrow the focus to advanced
algorithms to tackle the scheduling of automated guided vehicles. Among their topics are formulations of the problems and solutions, network simplex: the fastest algorithm, dynamic network
simplex: dynamic complete advanced algorithm, greedy vehicle search: an incomplete advanced algorithm, and multi-load and heterogeneous vehicle scheduling hybrid solutions. Annotation ©2015
Ringgold, Inc., Portland, OR (protoview.com)
