RT - Journal Article
T1 - Simulation and Evaluation of Network Simplex Algorithm and its Extensions for Vehicle Scheduling Problems in Ports
JF - IJMT
YR - 2019
JO - IJMT
VO - 11
IS - 0
UR - http://ijmt.ir/article-1-647-en.html
SP - 1
EP - 12
K1 - Network Simplex Algorithm
K1 - Dynamic Network Simplex Algorithm
K1 - Optimization Methods
K1 - Dynamic Scheduling
K1 - Container Terminals
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.
LA eng
UL http://ijmt.ir/article-1-647-en.html
M3
ER -