Search Results for "vba genetic algorithm"

pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.

The ASCO project aims to bring circuit optimization capabilities to existing SPICE simulators using a high-performance parallel differential evolution (DE) optimization algorithm. It supports Eldo, HSPICE, LTspice, Spectre, and Qucs.

The NeuroSolutions: Formula Generator utility converts the weights file of a default MLP breadboard (1-hidden layer with a TanhAxon in the hidden layer and either a TanhAxon or BiasAxon in the output layer) into a usable formula that can be copied and pasted into your own programs to compute the output of the trained neural network.

libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported.

texgenpack is a texture compression and conversion program featuring a command line utility and a simple GUI program . Compression is implemented using a genetic algorithm. It supports compression, decompression, conversion and comparison of texture and image files. The image format supported is PNG, while for textures there is support for KTX, PKM and DDS using ETC1, ETC2, DXT1/3/5 or BPTC (BC7) texture compression. Several uncompressed texture format are also supported. This program requires the installation of libfgen, also avalable on SourceForge.

..."A Fast and Elitist multi-objective Genetic Algorithm: NSGA-II". Journal IEEE Transactions on Evolutionary Computation (IEEE-TEC). 2002. Vol. 6. No. 2. pp. 182-197. - Gilberto A. Ortiz, Diego A. Alvarez, Daniel Bedoya-Ruiz. "Identification of Bouc-Wen type models using multi-objective optimization algorithms". Computers & Structures. Vol. 114-115. pp. 121-132. 2013.

Alkindus is an automated solver for short monoalphabetic substitution ciphers without word divisions.

Developed as a final year project at Islamic University of Technology (IUT) during 2010 - 2011 academic year. This code is a simple implementation of real coded genetic algorithm for numerical optimization. Code is written in C/C++.

This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.

Evolutionary Structural Optimization Package (ESOP) consists of software for viewing, analyzing, and optimizing structures containing beam, truss, and membrane plate elements utilizing OpenGL and the Genetic Algorithm (GA). Created for use in M.S. theses

Searches for adecuate design for feedforward backpropagation neural network, employing genetic algorithm as refining engine. The result topolgy may not be orthodox.

This project aims to create an application to solve the job shop schedule problem using genetic algorithm on the IBM Cell BE processor. This is useful especially using the power of Cell for the large scale job shop schedule problem.

Modified NCBI Toolkit for Windows, added contextual BLAST algorithm.

A flexible programming library for evolutionary computation. Steady-state, generational and island model genetic algorithms are supported, using Darwinian, Lamarckian or Baldwinian evolution. Includes support for multiprocessor and distributed systems.

NullAllEst is the implementation of a maximum likelihood algorithm to estimate the frequency of a null allele in microsatellite genetic data. A Markov Chain Monte Carlo simulation is used to solve the likelihood function.

Disk Optimizer selects files to be placed on any disk medium that will maximize the space used. It is very efficient in finding an optimum file set since it uses a Genetic Algorithm instead of brute force.

The goal of the Rats and Mazes project is to build a simple genetic algorithm to find general solutions to random non-cyclic single path mazes. I believe that the solutions will tend towards either the right/left-hand rule.

This is a very simple implementation of the genetic algorithm framework presented by John Holland, based on Goldberg book Genetic Algorithms in Search, Optimization and Machine Learning.

A simple genetic algorithm (GA) program that demonstrates the dynamic behaviour of standard GAs.

Cosmos (by OpenGenus Foundation) is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.