ABSTRACT
This chapter presents an incomplete algorithm for the scheduling problem of Automated Guided Vehicles (AGVs). When the size of the problem goes beyond the limits or the time available for computation is too short, incomplete search methods are used. In fact, for any unassigned job and the list of idles AGVs, a job is assigned to a vehicle with minimum cost, including waiting and traveling times of the vehicles as well as the lateness of the jobs. The software does two tasks in the real-time processing and dynamic fashion. The distance between every two points in the port as well as the source and destination of jobs were chosen randomly. A heuristic is approximate in the sense that it provides a good solution for relatively little effort, but it does not guarantee optimality.” The weakness of the meta-heuristics is that effectiveness could be sensitive to the choice of parameters values and operators.
