TY - JOUR
T1 - Simulation and Evaluation of Network Simplex Algorithm and its Extensions for Vehicle Scheduling Problems in Ports
TT -
JF - IJMT
JO - IJMT
VL - 11
IS - 0
UR - http://ijmt.ir/article-1-647-en.html
Y1 - 2019
SP - 1
EP - 12
KW - Network Simplex Algorithm
KW - Dynamic Network Simplex Algorithm
KW - Optimization Methods
KW - Dynamic Scheduling
KW - Container Terminals
N2 - 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.
M3 10.29252/ijmt.11.1
ER -