In collaboration with Payame Noor University and Iranian Society of Instrumentation and Control Engineers
Control and Optimization
Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

Hassan Rashidi

Volume 2, Issue 2 , December 2017, , Pages 77-101

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 ...  Read More