Preferred Language
Articles
/
joe-1950
An Improved Adaptive Spiral Dynamic Algorithm for Global Optimization
...Show More Authors

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF) algorithm is designed so that the chemotaxis phase of bacteria represents the exploration part of the search operation. In contrast, the SDA represents the exploitation part.

Additionally, to improve search operation efficiency, the spiral model's radius and angular displacement are adaptively set according to a linear correlation concerning the fitness value. An additional phase, the elimination and dispersal phase, is obtained from BFA and added to the end of the SDA. This phase aims to improve the algorithm's final solution's accuracy by enhancing the algorithm's search strategy and performance. Simulation tests are run on unimodal and multimodal standard benchmark functions to verify the proposed algorithm. The proposed algorithm significantly outperforms SDA and Adaptive SDA (ASDA) algorithms regarding fitness value and accuracy.

 

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Mar 23 2023
Journal Name
Journal Of Applied Science And Engineering
Strong Fenchel Duality for Evenly Convex Optimization Problems
...Show More Authors

Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.

View Publication
Scopus (1)
Scopus Clarivate
Publication Date
Thu Jun 09 2022
Journal Name
2022 International Congress On Human-computer Interaction, Optimization And Robotic Applications (hora)
Optimization of Particle Swarms for Travelling Salesman Problem
...Show More Authors

The Traveling Salesman Problem is a story application of Atom Swarm Optimizations in this research. We have developed several novel techniques intended for solving TSP with PSO. Additionally, we introduced the notions to Swap Operative and Swap Chronological sequence and redefining the remaining operatives their foundation; that way, the study created unique PSO. Research prove it can produce satisfactory outcomes. The aim of this paper be there to assess the functioning of particle swarm optimization, for the going salesman issue TSP. The solution to this trouble is common to be NP-hard, it has N! permutations. The study's goal is to examine the capacity of both algorithms to solve intercontinental and other benchmark problems. Overall, th

... Show More
View Publication
Scopus (4)
Crossref (3)
Scopus Crossref
Publication Date
Mon Oct 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Bayesian Tobit Quantile Regression Model Using Double Adaptive elastic net and Adaptive Ridge Regression
...Show More Authors

     Recently Tobit  Quantile Regression(TQR) has emerged as an important tool in statistical analysis . in order to improve the parameter estimation in (TQR) we proposed Bayesian hierarchical model with double adaptive elastic net technique  and Bayesian hierarchical model with adaptive ridge regression technique .

 in double adaptive elastic net technique we assume  different penalization parameters  for penalization different regression coefficients in both parameters λ1and  λ, also in adaptive ridge regression technique we assume different  penalization parameters for penalization different regression coefficients i

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Dec 01 2016
Journal Name
International Journal Of Vlsi Design & Communication Systems (vlsics)
SIMULTANEOUS OPTIMIZATION OF STANDBY AND ACTIVE ENERGY FOR SUB THRESHOLD CIRCUITS
...Show More Authors

Increased downscaling of CMOS circuits with respect to feature size and threshold voltage has a result of dramatically increasing in leakage current. So, leakage power reduction is an important design issue for active and standby modes as long as the technology scaling increased. In this paper, a simultaneous active and standby energy optimization methodology is proposed for 22 nm sub-threshold CMOS circuits. In the first phase, we investigate the dual threshold voltage design for active energy per cycle minimization. A slack based genetic algorithm is proposed to find the optimal reverse body bias assignment to set of noncritical paths gates to ensure low active energy per cycle with the maximum allowable frequency at the optimal supply vo

... Show More
View Publication Preview PDF
Publication Date
Wed Apr 05 2023
Journal Name
Journal Of Engineering
Construction Time-Cost Optimization Modeling Using Ant Colony Optimization
...Show More Authors

In the field of construction project management, time and cost are the most important factors to be considered in planning every project, and their relationship is complex. The total cost for each project is the sum of the direct and indirect cost. Direct cost commonly represents labor, materials, equipment, etc.
Indirect cost generally represents overhead cost such as supervision, administration, consultants, and interests. Direct cost grows at an increasing rate as the project time is reduced from its original planned time. However, indirect cost continues for the life of the project and any reduction in project time means a reduction in indirect cost. Therefore, there is a trade-off between the time and cost for completing construc

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Fri Feb 01 2019
Journal Name
Indian Journal Of Natural Sciences
Surface Photometry and Morphology Properties of Spiral Galaxies: NGC4725, NGC4639 as Case Study
...Show More Authors

In this study, two active galaxies (NGC4725, NGC4639) have been chosen to study their morphological and photometric properties, by using the IRAF ISOPHOTE ELLIPS task with griz-filters. Observations are obtained from the Sloan Digital Sky Survey (SDSS) which reaches now to the DATA Release (DR14). The data reduction of all images (bias and flat field) has been done by SDSS Pipeline. The surface photometric investigation was performed like the magnitude. Together with isophotal contour maps, surface brightness profiles and a bulge/disk decomposition of the images of the galaxies, although the disk position angle, ellipticity, and inclination of the galaxies have been done. Also, the color of galaxies was studied, where chromatic distribution

... Show More
View Publication
Publication Date
Mon Dec 18 2017
Journal Name
Al-khwarizmi Engineering Journal
Cam Dynamic Synthesis
...Show More Authors

The paper presents an original method to make the geometric synthesis of the rotary cam and translated tappet with roll. Classical method uses to the geometric synthesis and the reduced tappet velocity, and in this mode the geometric classic method become a geometric and kinematic synthesis method. The new geometric synthesis method uses just the geometric parameters (without velocities), but one utilizes and a condition to realize at the tapped the velocities predicted by the tapped movement laws imposed by the cam profile. Then, it makes the dynamic analyze for the imposed cam profile, and one modify the cam profile geometric parameters to determine a good dynamic response (functionality). In this mode it realizes the dynamic synthesis

... Show More
View Publication Preview PDF
Publication Date
Fri Feb 19 2016
Journal Name
International Journal Of Pure And Applied Mathematics
THE ROLE OF DYNAMIC PROGRAMMING IN THE DISTRIBUTION OF INVESTMENT ALLOCATIONS BETWEEN PRODUCTION LINES WITH AN APPLICATION
...Show More Authors

At present, the ability to promote national economy by adjusting to political, economic, and technological variables is one of the largest challenges faced by organization productivity. This challenge prompts changes in structure and line productivity, given that cash has not been invested. Thus, the management searches for investment opportunities that have achieved the optimum value of the annual increases in total output value of the production line workers in the laboratory. Therefore, the application of dynamic programming model is adopted in this study by addressing the division of investment expenditures to cope with market-dumping policy and to strive non-stop production at work.

View Publication Preview PDF
Scopus (10)
Crossref (11)
Scopus Crossref
Publication Date
Tue Feb 01 2022
Journal Name
Baghdad Science Journal
Retina Based Glowworm Swarm Optimization for Random Cryptographic Key Generation
...Show More Authors

The biometric-based keys generation represents the utilization of the extracted features from the human anatomical (physiological) traits like a fingerprint, retina, etc. or behavioral traits like a signature. The retina biometric has inherent robustness, therefore, it is capable of generating random keys with a higher security level compared to the other biometric traits. In this paper, an effective system to generate secure, robust and unique random keys based on retina features has been proposed for cryptographic applications. The retina features are extracted by using the algorithm of glowworm swarm optimization (GSO) that provides promising results through the experiments using the standard retina databases. Additionally, in order t

... Show More
View Publication Preview PDF
Scopus (13)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Mon Feb 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Features of genetic algorithm for plain text encryption
...Show More Authors

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

... Show More
View Publication
Scopus (15)
Crossref (4)
Scopus Crossref