Showing 3 results for Tahershamsi
A. Tahershamsi , R. Sheikholeslami,
Volume 1, Issue 3 (9-2011)
Abstract
In engineering, flood routing is an important technique necessary for the solution of a floodcontrol problem and for the satisfactory operation of a flood-prediction service. A simple conceptual model like the Muskingum model is very effective for the flood routing process. One challenge in application of the Muskingum model is that its parameters cannot be measured physically. In this article we proposed imperialist competitive algorithm (ICA) for optimal parameter estimation of the linear Muskingum model. This algorithm uses imperialism and imperialistic competition process as a source of inspiration. Optimization to identify Muskingum model parameters can be considered as a suitable field to investigate the efficiency of this algorithm.
A. Tahershamsia, A. Kaveh, R. Sheikholeslamia , S. Talatahari,
Volume 2, Issue 1 (3-2012)
Abstract
The Big Bang-Big Crunch (BB–BC) method is a relatively new meta-heuristic algorithm which inspired by one of the theories of the evolution of universe. In the BB–BC optimization algorithm, firstly random points are produced in the Big Bang phase then these points are shrunk to a single representative point via a center of mass or minimal cost approach in the Big Crunch phase. In this paper, the BB–BC algorithm is presented for optimal cost design of water distribution systems and employed to optimize different types of hydraulic networks with discrete variables. The results demonstrate the efficiency of the proposed method compared to other algorithms.
R. Sheikholeslami, A. Kaveh, A. Tahershamsi , S. Talatahari,
Volume 4, Issue 1 (3-2014)
Abstract
A charged system search algorithm (CSS) is applied to the optimal cost design of water distribution networks. This algorithm is inspired by the Coulomb and Gauss’s laws of electrostatics in physics. The CSS utilizes a number of charged particles which influence each other based on their fitness values and their separation distances considering the governing law of Coulomb. The well-known benchmark instances, Hanoi network, double Hanoi network, and New York City tunnel problem, are utilized as the case studies to evaluate the optimization performance of CSS. Comparison of the results of the CSS with some other meta-heuristic algorithms indicates the performance of the new algorithm.
