Giter VIP home page Giter VIP logo

ashu20138005 / chaotic-gsa-for-engineering-design-problems Goto Github PK

View Code? Open in Web Editor NEW

This project forked from sajadahmad1/chaotic-gsa-for-engineering-design-problems

0.0 1.0 0.0 99 KB

All nature-inspired algorithms involve two processes namely exploration and exploitation. For getting optimal performance, there should be a proper balance between these processes. Further, the majority of the optimization algorithms suffer from local minima entrapment problem and slow convergence speed. To alleviate these problems, researchers are now using chaotic maps. The Chaotic Gravitational Search Algorithm (CGSA) is a physics-based heuristic algorithm inspired by Newton's gravity principle and laws of motion. It uses 10 chaotic maps for global search and fast convergence speed. Basically, in GSA gravitational constant (G) is utilized for adaptive learning of the agents. For increasing the learning speed of the agents, chaotic maps are added to gravitational constant. The practical applicability of CGSA has been accessed through by applying it to nine Mechanical and Civil engineering design problems which include Welded Beam Design (WBD), Compression Spring Design (CSD), Pressure Vessel Design (PVD), Speed Reducer Design (SRD), Gear Train Design (GTD), Three Bar Truss (TBT), Stepped Cantilever Beam design (SCBD), Multiple Disc Clutch Brake Design (MDCBD), and Hydrodynamic Thrust Bearing Design (HTBD). The CGSA has been compared with seven state of the art stochastic algorithms particularly Constriction Coefficient based Particle Swarm Optimization and Gravitational Search Algorithm (CPSOGSA), Standard Gravitational Search Algorithm (GSA), Classical Particle Swarm Optimization (PSO), Biogeography Based Optimization (BBO), Continuous Genetic Algorithm (GA), Differential Evolution (DE), and Ant Colony Optimization (ACO). The experimental results indicate that CGSA shows efficient performance as compared to other seven participating algorithms.

MATLAB 100.00%

chaotic-gsa-for-engineering-design-problems's Introduction


This is the 'Chaotic Gravitational Search Algorithm' Mathlab code for Solving  Engineering design Benchmarks.

Change 'benchmark_functions.m' and 'benchmark_functions_details.m' for your own applications like solving other engineering problems 
and numerical optimization frameworks.

////
[email protected]
\\\\


functions:

Main.m : Main function for using Chaotic GSA algorithm.

CHGSA: Chaotic Gravitational Search Algorithm 

GSA.m : Gravitational Search Algorithm.

bbo.m  :Biogeograpgy Based Optiumization

pso.m: Particle Swarm Optimization

DE.m: Differential Evolution

GWO.m: Grey Wolf Optimizer

SCA.m: Sine Cosine Algorithm

SSA.m: Salp Swarm Algorithm

PSOGSA.m: Particle Swarm Optimization and Gravittaional Search Algorithm

CPSOGSA: Constriction Coefficient based particle swarm optimization and Gravitational Search Algorithm

GA.m: Genetic Algorithm

ACO.m: Any Colony Optimization

chaos.m : For getting graphs of ten chaotic maps

crossover_continious : It is for calculating the cross_over rate of agents in successive generations

mutation_continious: It is used for changing the diversity of agents and helps in exploitation of the candidate solutions.

Geinitialization : It is utilized for exploration of the search space i.e. Diversification.

initializationGWO: Randomized initialization of GWO searcher agents.

initializationSCA: Initialization of SCA agents.

initializationSSA: Initialization of SSA optimization algorithm searcher agents for randomization.

RouletteWheelSelection.m : finds optimal candidate solutions.

selection.m : Particulaily used in GA, for increasing local exploration rate.

initialization.m : initializes the position of agents in the search space, randomly.

Gfield.m : calculates the accelaration of each agent in gravitational field.

move.m : updates the velocity and position of agents.

massCalculation.m : calculates the mass of each agent.

Gconstant.m : calculates Gravitational constant.

space_bound.m : checks the search space boundaries for agents.

Scatter Plot.m: Fot getting correlation between best solutions of algorithms.

evaluateF.m : Evaluates the agents.

benchmark_functions.m : calculates the value of cost function.

benchmark_functions_details.m : gives boundaries and dimension of search space for design cost functions.

chaotic-gsa-for-engineering-design-problems's People

Contributors

sajadahmad1 avatar

Watchers

James Cloos avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.