A modified real coded genetic algorithm for constrained optimization

Thakur, Manoj; Meghwani, Suraj S.; Jalota, Hemant

doi:10.1016/j.amc.2014.02.093

Cited by 59 publications

(29 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(4) and the parameter set to be estimated is given by the singleton a = {m}. Above optimization problem is solved using the genetic algorithm (LX-PM) [45,54,55] which is discussed in the previous section. Figures 18 and 19 illustrate the dynamics of the system (4) corresponding to the actual (reference) values and estimated values of the parameter, m, the prey reserve.…”

mentioning

confidence: 99%

Dynamical analysis of a prey–predator model with Beddington–DeAngelis type function response incorporating a prey refuge

2014

Self Cite

View full text Add to dashboard Cite

This paper discusses a prey-predator model with reserved area. The feeding rate of consumers (predators) per consumer (i.e., functional response) is considered to be Beddington-DeAngelis type. The Beddington-DeAngelis functional response is similar to the Holling type II functional response but contains an extra term describing mutual interference by predators. We investigate the role of reserved region and degree of mutual interference among predators in the dynamics of system. We obtain different conditions that affect the persistence of the system. We also discuss local and global asymptotic stability behavior of various equilibrium solutions to understand the dynamics of the model system. The global asymptotic stability of positive interior equilibrium solution is established using suitable Lyapunov functional. It is found that the Hopf bifurcation occurs when the parameter corresponding to reserved region (i.e., m) crosses some critical value. Our result indicates that the predator species exist so long as prey reserve value (m) does not cross a threshold value and after this value the predator species extinct. To mimic the real-world scenario, we also solve the inverse problem of estimation of model parameter (m) using the sampled data of the system. The results can also be interpreted in different contexts such as resource conservation, pest management and

show abstract

mentioning

confidence: 99%

Dynamical analysis of a prey–predator model with Beddington–DeAngelis type function response incorporating a prey refuge

2014

Self Cite

View full text Add to dashboard Cite

show abstract

“…Also, the number of function evaluations values obtained by other algorithms such as DE, RST2, SOMA, and SOMGA for all the three models, as reported in [50], LX-POL and LX-PM [51], and MDE algorithms [17]. It can be observed from Table 4 that SASOS provided better 8 Complexity results for all the three systems among all results quoted in [17], in terms of best objective values.…”

Section: Discussionmentioning

confidence: 89%

Hybridized Symbiotic Organism Search Algorithm for the Optimal Operation of Directional Overcurrent Relays

et al. 2018

View full text Add to dashboard Cite

This paper presents the solution of directional overcurrent relay (DOCR) problems using Simulated Annealing based Symbiotic Organism Search (SASOS). The objective function of the problem is to minimize the sum of the operating times of all primary relays. The DOCR problem is nonlinear and highly constrained with two types of decision variables, namely, the time dial settings (TDS) and plug setting (PS). In this paper, three models of the problem are considered, the IEEE 3-bus, 4-bus, and 6-bus, respectively. We have applied SASOS to solve the problem and the obtained results are compared with other algorithms available in the literature.

show abstract

“…GAs for single the utmost common stochastic quest dealings [9]. It is naturally encouraged optimization plus search procedure settled by Holland.…”

Section: Genetic Proceduresmentioning

confidence: 99%

Comparative Study of Energy Saving Grid-based heuristic approaches in dispersed computational environment

Kaur¹

2017

ijecs

View full text Add to dashboard Cite

Completing for huge parallel jobs in dispersed computational environments requires co-distribution for significant resources mutually shared with their possessors. The scheduling plus resource selection complications in Grid remain NPhard because for their combinatorial environment. Various algorithms, depending on heuristic solutions, or their groupings have been implemented for similar jobs with dependences in disseminated environments. Task schedulers target to improve the whole performance for a segment, e.g., decreasing the average work response time and increasing the number for tasks accomplished in certain point for time. A 'Network' stands an arrangement aimed at reserve allocation. This stands cast off in huge scale files dispensation, numerous for solicitations presence logical ones. Grid forecast is an important constituent Network structure.

show abstract

A modified real coded genetic algorithm for constrained optimization

Cited by 59 publications

References 25 publications

Dynamical analysis of a prey–predator model with Beddington–DeAngelis type function response incorporating a prey refuge

Dynamical analysis of a prey–predator model with Beddington–DeAngelis type function response incorporating a prey refuge

Hybridized Symbiotic Organism Search Algorithm for the Optimal Operation of Directional Overcurrent Relays

Comparative Study of Energy Saving Grid-based heuristic approaches in dispersed computational environment

Contact Info

Product

Resources

About