A modified approach to cross entropy method: Elitist stepped distribution algorithm

This paper introduces a new algorithm named Elitist Stepped Distribution Algorithm (ESDA), which is inspired from the existing Cross Entropy Method (CEM) through the modification of elite sample based normal distribution used in CEM. Considering the natural behavior of normal distribution, ESDA is proposed to enhance the drawbacks of CEM through improving the efficiency in both exploration and exploitation processes when applying for complex function optimization problems. In ESDA, the elite sample percent defined in CEM is separated into two parts: (1) elite sample percent to calculate the mean value, and (2) elite sample percent to calculate standard deviation of normal distribution to construct an applicable balance between exploration and exploitation ability of the algorithm at a reasonable convergence speed. The elite sample percent parameter for the mean guides the algorithm to focus more on the better solutions and therefore improves the exploitation ability, whereas the elite sample percent parameter for the standard deviation controls the length of standard deviation to handle the exploration process more effectively. Performance of ESDA is investigated using unconstrained benchmark problems and compared with CEM, Simple Genetic Algorithm and Particle Swarm Optimization. The comparisons on unimodal and multi-modal functions confirm the efficiency of the algorithm in both exploration and exploitation process. In addition, the performance of ESDA is tested using constrained engineering problems commonly used in literature by comparing its performance with the other ones statistically. The results on engineering problems also prove that ESDA is perfectly applicable in real-world applications.


A modified algorithm for peer-to-peer security
Akleylek, Sedat; Emmungil, Levent; NURİYEV, URFAT (2007-01-01)
In this paper we present the steganographic approach to peer-to-peer systems with a modified algorithm. This gives the user a very high level of protection against being compelled to disclose its contents. Even the realization of the quantum computer cannot solve NP-hard problem in a polynomial time, a modified algorithm with steganographic use depending on Knapsack problem may make peer-to-peer systems secure.
Improving the big bang-big crunch algorithm for optimum design of steel frames
Hasançebi, Oğuzhan (null; 2012-01-01)
This paper presents an improved version of the big bang-big crunch (BB-BC) algorithm namely exponential BB-BC algorithm (EBB-BC) for optimum design of steel frames according to ASD-AISC provisions. It is shown that the standard version of the algorithm sometimes is unable to provide reasonable solutions for problems from discrete design optimization of steel frames. Therefore, by investigating the shortcomings of the BB-BC algorithm, it is aimed to enhance the algorithm for solving complicated steel frame o...
An Efficient Metaheuristic Algorithm for Engineering Optimization: SOPT
Hasançebi, Oğuzhan (2012-06-01)
Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps; namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependency on few parameters only are among the advantageous characteristics of the proposed SOPT algorithm. The efficienc...
A neural network method for direction of arrival estimation with uniform circular dipole array in the presence of mutual coupling
Caylar, Selcuk; Leblebicioğlu, Mehmet Kemal; Dural, Guelbin (2007-06-16)
In recent years application of Neural Network (NN) algorithms in both target tracking problem and DoA estimation have become popular because of the increased computational efficiency This paper presents the implementation of modified neural network algorithm(MN-MUST) to the uniform circular dipole array in the presence of mutual coupling. In smart antenna systems, mutual coupling between elements can significantly degrade the processing algorithms. In this paper mutual coupling affects on MN-MUST has been i...
An interactive approach for biobjective integer programs under quasiconvex preference functions
Ozturk, Diclehan Tezcaner; Köksalan, Mustafa Murat (2016-09-01)
We develop an interactive algorithm for biobjective integer programs that finds the most preferred solution of a decision maker whose preferences are consistent with a quasiconvex preference function to be minimized. During the algorithm, preference information is elicited from the decision maker. Based on this preference information and the properties of the underlying quasiconvex preference function, the algorithm reduces the search region and converges to the most preferred solution progressively. Findin...
Citation Formats
M. Altun and O. Pekcan, “A modified approach to cross entropy method: Elitist stepped distribution algorithm,” APPLIED SOFT COMPUTING, pp. 756–769, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47974.