Analysis and Scheduling of machinery in an Intermodal Terminal by using the OSPF Concept

Abstract: The design of an Internet Protocol (IP) network is a long-term investment where many aspects must be taken into consideration. Some of them are the cost of the design, network sustainability and aspects regarding traffic engineering. When, its matter to design an IP network for an industry like Sea ports or Container Terminal than the factors related to traffic engineering and scheduling needs more attention. This thesis addresses the problems of designing and suggests a solution with IP network by using the concept of Open Shortest Path First (OSPF) routing algorithm. The routing in OSPF telecommunication networks is determined by computing shortest paths with respect to link weights sets by the network operator. In this research the shortest path computed on the basis of Current status, Current location, distance and cargo limitation of Automated Guided Vehicles that are using cassettes to transfer containers, which are called C-AGVs. A MATLAB based simulation tool is developed and is used to test and compare the OSPF algorithm to the general scheduling processes in a container terminal. The results show that using the OSPF concept it will yield in higher productivity.