Scheduling in Container Terminals using NetworkSimplex Algorithm

الموضوعات :

Hassan Rashidi ¹ (Department of Computer Engineering, Islamic Azad University of Qazvin, Qazvin, Iran)

تاريخ الإرسال : 23 الأحد , صفر, 1431 تاريخ التأكيد : 23 الأحد , صفر, 1431 تاريخ الإصدار : 23 الأحد , صفر, 1431

الکلمات المفتاحية: Scheduling, Container Terminals, Minimum Cost Flow Problem, Network Simplex Algorithm, Optimization methods,

ملخص المقالة :

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional simplex algorithm for Linear Programs. Many random data are generated and fed to the model for 50 vehicles. The results show that NSA is fast and efficient. It is found that, in practice, NSA takes polynomial time to solve problems in this application.