TY - JOUR
ID - 11
TI - Scheduling in Container Terminals using Network
Simplex Algorithm
JO - Journal of Optimization in Industrial Engineering
JA - JOIE
LA - en
SN - 2251-9904
AU - Rashidi, Hassan
AD - Department of Computer Engineering, Islamic Azad University of Qazvin, Qazvin, Iran
Y1 - 2010
PY - 2010
VL - Volume 1
IS - Issue 1
SP - 9
EP - 16
KW - Container Terminals
KW - Minimum Cost Flow Problem
KW - Network Simplex Algorithm
KW - Optimization methods
KW - Scheduling
DO -
N2 - 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.
UR - http://www.qjie.ir/article_11.html
L1 - http://www.qjie.ir/article_11_864034c1f5a7d29374eb529cf2d9f8f0.pdf
ER -