A dynamic version for the Network Simplex Algorithm
We present a dynamic version for the Network Simplex Algorithm, which is called Dynamic Network Simplex Algorithm (DNSA). The overall approach of DNSA is to update the graph model dynamically and repair its spanning tree. To test the algorithm and its performance, an application of Automated Guided Vehicles in container terminals is used. The results show considerable improvements, in terms of reducing the number of iterations.
dynamic network simplex algorithm container terminals dynamic scheduling optimization methods