for any agency dealing with the design of the water distribution network, an economic design will be an objective. in this research, central force optimization (cfo) and differential evolution (de) algorithm were used to optimize ismail abad water distribution network. optimization of the network has been evaluated by developing an optimization model based on cfo and de algorithm in matlab and ...

network expansion studies normally offer new power lines, new substations or expansion of existing substations. they are generally proposed based on technical requirements, but financial restrictions are not considered. because of financial restrictions, ranking of network expansion plans is required. in this paper an algorithm for such ranking, based on technical and financial view points and ...

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on an n-vertex, m-arc network in at most nm pivots and O(nZm) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm log n). This bound is less than a loga...

The Minimum Cost Network Flow Problem (MCNFP) constitutes a wide category of network flow problems. A Dual Network Exterior Point Simplex Algorithm (DNEPSA) for the MCNFP is presented here, together with some computational results. Similarly to the classical Dual Network Simplex Algorithm (DNSA), the new algorithm starts with a dual feasible tree-solution and, after a number of iterations, it p...

A network simplex algorithm is described for the minimum-cost network flow problem on a generalized network with the additional constraint that there exist sets of arcs which must carry equal amounts of flow. This problem can be modeled as a linear programming problem and solved using the standard simplex algorithm. However, due to the structure of the problem, more efficient algorithms are pos...

We introduce a new network simplex pivot rule for the shortest path simplex algorithm. This new pivot rule chooses a subset of non-basic arcs to enter into the basis simultaneously. We call to this operation multiple pivot. We show that a shortest path simplex algorithm with this pivot rule makes O(n) multiple pivots and runs in O(nm) time. This new pivot rule is based on the new concept of pse...

DYLP is a full implementation of the dynamic simplex algorithm for linear programming. Dynamic simplex attempts to maintain a reduced active constraint system by regularly purging loose constraints and variables with unfavourable reduced costs, and adding violated constraints and variables with favourable reduced costs. In abstract, the code alternates between primal and dual simplex algorithms...

augmented downhill simplex method (adsm) is introduced here, that is a heuristic combination of downhill simplex method (dsm) with random search algorithm. in fact, dsm is an interpretable nonlinear local optimization method. however, it is a local exploitation algorithm; so, it can be trapped in a local minimum. in contrast, random search is a global exploration, but less efficient. here, rand...

By integrating the underlying developmental mechanisms for the phenotypic formation of traits into a mapping framework, functional mapping has emerged as an important statistical approach for mapping complex traits. In this note, we explore the feasibility of using the simplex algorithm as an alternative to solve the mixture-based likelihood for functional mapping of complex traits. The results...