Chapter 9Greedy Vehicle Search: An Incomplete Advanced Algorithm
In this chapter, an incomplete algorithm for the scheduling problem of Automated Guided Vehicles (AGVs) is presented. We called it Greedy Vehicle Search (GVS). To evaluate the relative strength and weakness of Network Simplex plus Algorithm (NSA+) and GVS, the results of the two algorithms are compared.
9.1 Motivations
In the previous three chapters, the scheduling problem of AGVs, the problem in Chapter 5, was solved by NSA and its extensions. Although these complete solutions are efficient, they can only work on problems with certain limits in size (see Section 6.6). When the size of the problem goes beyond the limits or the time available for ...
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.
