Chapter 6Network Simplex: The Fastest Algorithm
In Chapter 5, the scheduling problem of Automated Guided Vehicles (AGVs) in the container terminals was formulated as a special case of Minimum Cost Flow model. The model was introduced as the MCF-AGV. This chapter focuses on the standard Network Simplex Algorithm (NSA) to tackle the MCF-AGV in static aspect. In this aspect the number of jobs, the distance between the source and destination of the jobs, and the number of vehicles do not change (see Assumption 5-9).
6.1 Reasons to Choose NSA
The main reasons to choose NSA are as follows:
NSA is a solution for the Minimum Cost Flow (MCF) model. This model has a rich history and it arises in almost all industries, ...
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.
