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

In open-pit mine planning, the design of the most profitable ultimate pit limit is a prerequisite to developing a feasible mining sequence. Currently, the design of an ultimate pit is achieved through a computer program in most mining companies. The extraction of minerals in open mining methods needs a lot of capital investment, which may take several decades. Before the extraction, the p...

In order to meet the performance requirements of global optimality and path smoothness in robot planning, a new fusion algorithm jump-A* dynamic window approach is proposed. First, A* optimized by using jump point search method distance evaluation function defined Manhattan Euclidean obtain information. Then take as core integrating information safely plan op...

this paper presents a methodology for design of instrumentation sensor networks in non-linear chemical plants. the method utilizes a robust extended kalman filter approach to provide an efficient dynamic data reconciliation. a weighted objective function has been introduced to enable the designer to incorporate each individual process variable with its own operational importance. to enhance the...

Methods for calculating Available Transfer Capability (ATC) of the transmission systems may be grouped under Static and Dynamic methods. This paper presents a fast dynamic method for ATC calculations, which considers both Transient Stability Limits and Voltage Stability Limits as terminating criteria. A variation of Energy Function Method is used to determine the transient stability limit and t...