Simulation and Evaluation of Network Simplex Algorithm and its Extensions for Vehicle Scheduling Problems in Ports
Open Access
- 1 March 2019
- journal article
- Published by CMV Verlag in International Journal of Maritime Technology
- Vol. 11 (Winter and), 1-12
- https://doi.org/10.29252/ijmt.11.1
Abstract
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+). ...Keywords
This publication has 21 references indexed in Scilit:
- A dynamic version for the Network Simplex AlgorithmApplied Soft Computing, 2014
- Maximum dynamic network flow interdiction problem: New formulation and solution proceduresComputers & Industrial Engineering, 2013
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminalsComputers & Mathematics with Applications, 2011
- A General Pricing Scheme for the Simplex MethodAnnals of Operations Research, 2003
- A survey of dynamic network flowsAnnals of Operations Research, 1989
- An efficient implementation of the network simplex methodMathematical Programming Studies, 1986
- Theoretical Properties of the Network Simplex MethodMathematics of Operations Research, 1979
- Pivot Strategies for Primal-Simplex Network CodesJournal of the ACM, 1978
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- Finding the n Most Vital Links in Flow NetworksManagement Science, 1975