By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

This paper proposes the exchange market algorithm (EMA) to solve the combined economic and emission dispatch (CEED) problems in thermal power plants. The EMA is a new, robust and efficient algorithm to exploit the global optimum point in optimization problems. Existence of two seeking operators in EMA provides a high ability in exploiting global optimum point. In order to show the capabilities ...

The Fast Chirp Transform (FCT) provides a powerful formalism for the detection of signals with variable frequency, in much the same way that the Fourier transform provides a formalism for the detection of constant frequency signals. The FCT algorithm has significant applications in the detection of gravitational waves, particularly the gravitational wave signal produced by an inspiralling compa...

Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...

One of the most powerful tools for solving optimization problems is algorithms (inspired by nature) based on populations. These provide a solution to problem randomly searching in search space. The design’s central idea derived from various natural phenomena, behavior and living conditions organisms, laws physics, etc. A new population-based algorithm called Binary Spring Search Algorithm (BSSA...

This paper proposes a modification to the traditional binary search algorithm in which it checks the presence of the input element with the middle element of the given set of elements at each iteration. Modified binary search algorithm optimizes the worst case of the binary search algorithm by comparing the input element with the first & last element of the data set along with the middle elemen...

Gravitational search algorithm (GSA) has been successfully applied to many scientific and engineering applications in the past few years. In the original GSA and most of its variants, every agent learns from all the agents stored in the same elite group, namely K best . This type of learning strategy is in nature a fully-informed learning strategy, in which every agent has exactly the same glob...

the gravitational search algorithm (gsa) is a novel optimization methodbased on the law of gravity and mass interactions. it has good ability to search forthe global optimum, but its searching speed is really slow in the last iterations. sothe hybridization of particle swarm optimization (pso) and gsa can resolve theaforementioned problem. in this paper, a modified pso, which the movement ofpar...