Improved Crow Search Algorithm with Inertia Weight Factor and Roulette Wheel Selection Scheme

2017 ◽  
Author(s):  
Zhaojun Shi ◽  
Qishen Li ◽  
Sheng Zhang ◽  
Xiaojuan Huang
Keyword(s):  
Search Algorithm ◽  
Weight Factor ◽  
Selection Scheme ◽  
Roulette Wheel Selection ◽  
Inertia Weight ◽  
Roulette Wheel

Roulette Wheel Selection based Heuristic Algorithm for the Orienteering Problem

2014 ◽  
Vol 13 (1) ◽  
pp. 4127-4145
Author(s):  
Madhushi Verma ◽  
Mukul Gupta ◽  
Bijeeta Pal ◽  
Prof. K. K. Shukla
Keyword(s):  
Triangle Inequality ◽  
Time Budget ◽  
Control Point ◽  
Hamiltonian Path ◽  
Real Life ◽  
Tourism Industry ◽  
Orienteering Problem ◽  
Complete Graphs ◽  
Roulette Wheel Selection ◽  
Roulette Wheel

Orienteering problem (OP) is an NP-Hard graph problem. The nodes of the graph are associated with scores or rewards and the edges with time delays. The goal is to obtain a Hamiltonian path connecting the two necessary check points, i.e. the source and the target along with a set of control points such that the total collected score is maximized within a specified time limit. OP finds application in several fields like logistics, transportation networks, tourism industry, etc. Most of the existing algorithms for OP can only be applied on complete graphs that satisfy the triangle inequality. Real-life scenario does not guarantee that there exists a direct link between all control point pairs or the triangle inequality is satisfied. To provide a more practical solution, we propose a stochastic greedy algorithm (RWS_OP) that uses the roulette wheel selectionmethod, does not require that the triangle inequality condition is satisfied and is capable of handling both complete as well as incomplete graphs. Based on several experiments on standard benchmark data we show that RWS_OP is faster, more efficient in terms of time budget utilization and achieves a better performance in terms of the total collected score ascompared to a recently reported algorithm for incomplete graphs.

scholarly journals An improved harmony search algorithm for optimized link state routing protocol in vehicular ad hoc network

2018 ◽  
Vol 7 (2.14) ◽  
pp. 177
Author(s):  
Mustafa Raad Hammoodi ◽  
Ravie Chandren Muniyand
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Delivery Ratio ◽  
Roulette Wheel Selection ◽  
Link State ◽  
Improved Harmony Search

Vehicle Ad-hoc Network (VANET) is a direct application of Mobile Ad-hoc Network (MANET). Nodes in VANET are vehicles that communicate using vehicle to vehicle (V2V) or vehicle to infrastructure (V2I). These types of communications have led to the emergence of various applications that provide safer driving. Due to the high changing of topology and frequent fragmentation of VANET, routing pack-ets in this type of network is a hard task. In this work, the authors deal with the well-known MANET proactive Optimized Link State Rout-ing protocol (OLSR). The deployment of OLSR in VANET gives the moderate performance; this is due to its necessity of constant ex-changing of control packets. The performance of OLSR is highly dependent on its parameters, thus finding optimal parameters configura-tions that best fit VANETs environment and improves the network is essential before its deployment. Therefore, this research proposes a modified Harmony Search optimization (HSO) by incorporating selection methods in its memory consideration; roulette wheel selection to obtain fine-tuned OLSR for high density and velocity scenario. The experimental analysis showed that the OLSR with the proposed ap-proach acquired promising results regarding packet delivery ratio, end-to-end delay and overhead when compared with previous approaches.  

Self-adaptively Commensal Learning-based Jaya Algorithm with Multi-populations and its Application

2021 ◽  
Author(s):  
Zuanjia Xie ◽  
Chunliang Zhang ◽  
Haibin Ouyang ◽  
Steven Li ◽  
Liqun Gao
Keyword(s):  
Learning Strategy ◽  
Optimization Problems ◽  
State Of The Art ◽  
Global Optimum ◽  
Benchmark Problems ◽  
Series System ◽  
Jaya Algorithm ◽  
Roulette Wheel Selection ◽  
Roulette Wheel ◽  
Distribution Scheme

Abstract Jaya algorithm is an advanced optimization algorithm, which has been applied to many real-world optimization problems. Jaya algorithm has better performance in some optimization field. However, Jaya algorithm exploration capability is not better. In order to enhance exploration capability of the Jaya algorithm, a self-adaptively commensal learning-based Jaya algorithm with multi-populations (Jaya-SCLMP) is presented in this paper. In Jaya-SCLMP, a commensal learning strategy is used to increase the probability of finding the global optimum, in which the person history best and worst information is used to explore new solution area. Moreover, a multi-populations strategy based on Gaussian distribution scheme and learning dictionary is utilized to enhance the exploration capability, meanwhile every sub-population employed three Gaussian distributions at each generation, roulette wheel selection is employed to choose a scheme based on learning dictionary. The performance of Jaya-SCLMP is evaluated based on 28 CEC 2013 unconstrained benchmark problems. In addition, three reliability problems, i.e. complex (bridge) system, series system and series-parallel system are selected. Compared with several Jaya variants and several state-of-the-art other algorithms, the experimental results reveal that Jaya-SCLMP is effective.

scholarly journals An Improved Genetic Fuzzy Logic Control Method to Reduce the Enlargement of Coal Floor Deformation in Shearer Memory Cutting Process

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Chao Tan ◽  
Rongxin Xu ◽  
Zhongbin Wang ◽  
Lei Si ◽  
Xinhua Liu
Keyword(s):  
Fuzzy Logic ◽  
Fuzzy Logic Control ◽  
Control Method ◽  
Improved Genetic Algorithm ◽  
Roulette Wheel Selection ◽  
Logic Control ◽  
Roulette Wheel ◽  
Manual Adjustment ◽  
Tangent Function ◽  
Memory Cutting

In order to reduce the enlargement of coal floor deformation and the manual adjustment frequency of rocker arms, an improved approach through integration of improved genetic algorithm and fuzzy logic control (GFLC) method is proposed. The enlargement of coal floor deformation is analyzed and a model is built. Then, the framework of proposed approach is built. Moreover, the constituents of GA such as tangent function roulette wheel selection (Tan-RWS) selection, uniform crossover, and nonuniform mutation are employed to enhance the performance of GFLC. Finally, two simulation examples and an industrial application example are carried out and the results indicate that the proposed method is feasible and efficient.

scholarly journals The quasispecies regime for the simple genetic algorithm with roulette wheel selection

2017 ◽  
Vol 49 (3) ◽  
pp. 903-926 ◽  
Author(s):  
Raphaël Cerf
Keyword(s):  
Genetic Algorithm ◽  
Selection Mechanism ◽  
Roulette Wheel Selection ◽  
Mutation Probability ◽  
Roulette Wheel ◽  
Simple Genetic Algorithm ◽  
Crossover Probability ◽  
Mean Fitness ◽  
The Mean ◽  
Best Fit

Abstract We introduce a new parameter to discuss the behavior of a genetic algorithm. This parameter is the mean number of exact copies of the best-fit chromosomes from one generation to the next. We believe that the genetic algorithm operates best when this parameter is slightly larger than 1 and we prove two results supporting this belief. We consider the case of the simple genetic algorithm with the roulette wheel selection mechanism. We denote by ℓ the length of the chromosomes, m the population size, pC the crossover probability, and pM the mutation probability. Our results suggest that the mutation and crossover probabilities should be tuned so that, at each generation, the maximal fitness multiplied by (1 - pC)(1 - pM)ℓ is greater than the mean fitness.

Sign in / Sign up

Export Citation Format

Share Document