Chapter 7Network Simplex Plus: Complete Advanced Algorithm
In Chapter 6, the static scheduling problem of Automated Guided Vehicles (AGVs) in container terminals was solved by the standard version of Network Simplex Algorithm (NSA). In this chapter, some modifications are applied to NSA to obtain a novel version of the algorithm. The new algorithm is then applied to the dynamic scheduling problem of AGVs in container terminals (the problem defined in Chapter 5 and modeled as the MCF-AGV).
7.1 Motivations
Although NSA is efficient, cycling may occur in the algorithm. Additionally, to tackle the dynamic scheduling problem in Chapter 5, we need more efficient algorithms. In dynamic problems, new jobs arrive continually, ...
Get Port Automation and Vehicle Scheduling, 3rd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
