AU - Rashidi, Hassan
TI - Simulation and Evaluation of Network Simplex Algorithm and its Extensions for Vehicle Scheduling Problems in Ports
PT - JOURNAL ARTICLE
TA - IJMT
JN - IJMT
VO - 11
VI - 0
IP - 0
4099 - http://ijmt.ir/article-1-647-en.html
4100 - http://ijmt.ir/article-1-647-en.pdf
SO - IJMT 0
AB - The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this paper are to simulate and investigate the advantages and disadvantages of NSA compared with those of the three extensions in practical situations. To perform the evaluation, an application of these algorithms to scheduling problem of automated guided vehicles in container terminal is used. In the experiments, the number of iterations, CPU-time required to solve problems, overheads and complexity are considered.
CP - IRAN
IN - Department of Mathematics and Computer Science, Allameh Tabataba’i University Tehran, Iran
LG - eng
PB - IJMT
PG - 1
PT - Research Paper
YR - 2019