Tag: software

  • 0

MAOS-TSP: Project Portal

MAOS-TSP [1] is a multiagent optimization system (MAOS) for solving the Traveling Salesman Problem (TSP). The source code can be downloaded here. Related Information: Please find other related code and software in our Source Code Library. Basic Description What’s New Directories & Files Command Line & Parameters Output Information References Contact License Information: You can

Read More

  • 0

MAOS-GCP: Project Portal

MAOS-GCP [1] is a cooperative group optimization system (MAOS) for solving the Graph Coloring Problem (GCP). Related Information: MAOS-GCP shares the MAOS kernel with other MAOS applications (e.g. MAOS-TSP, MAOS-FSP, MAOS-QAP, MAOS-QKP), and contains some modules that are specifically for tacking GCP. Please find other related code and software in our Source Code Library. Basic Description

Read More

  • 0

MAOS-QKP: Project Portal

MAOS-QKP is a multiagent optimization system (MAOS) for solving the Quadratic Knapsack Problem (QKP). Related Information: MAOS-QKP shares the MAOS kernel with other MAOS applications (e.g. MAOS-GCP and MAOS-TSP), and contains some modules that are specifically for tacking QKP. Please find other related code and software in our Source Code Library. Basic Description What’s New Directories

Read More

  • 0

MAOS-FSP: Project Portal

MAOS-FSP [1] is a cooperative group optimization system (MAOS) for solving the Flowshop Scheduling Problem (FSP). Related Information: Please find other related code and software in our Source Code Library. Basic Description What’s New Directories & Files Command Line & Parameters Output Information References MAOS-FSP shares the MAOS kernel with other MAOS applications (e.g. MAOS-GCP

Read More

  • 0

MAOS-QAP: Project Portal

MAOS-QAP [1] is a cooperative group optimization system (MAOS) for solving the Quadratic Assignment Problem (QAP). Related Information: MAOS-QAP shares the MAOS kernel with other MAOS applications (e.g. MAOS-GCP and MAOS-TSP), and contains some modules that are specifically for tacking QAP. Please find other related code and software in our Source Code Library. Basic Description

Read More

  • 0

Social Cognitive Optimization (SCO): Project Portal

Social Cognitive Optimization (SCO) [1, 2] is an optimization algorithm for solving the (constrained) numerical optimization problem. SCO is an agent-based model based on the observational learning mechanism in human social cognition. In CGOS [3], SCO was hybridized with differential evolution (DE) to obtain better results than individual algorithms on a common set of benchmark

Read More

  • 0

Dissipative Particle Swarm Optimization (DPSO)

The dissipative particle swarm optimization (DPSO) is developed according to the self-organization of dissipative structure. The negative entropy is introduced into the particle swarm to construct an opening dissipative system that is far-from-equilibrium so as to driving the evolutionary process towards better fitness. Xiao-Feng Xie, Wen-Jun Zhang, and Zhi-Lian Yang. A dissipative particle swarm optimization.

Read More

  • 0

DEPSO Algorithm: Project Portal

DEPSO [1], or called DEPS, is an algorithm for (constrained) numerical optimization problem (NOP). DEPSO combines the advantages of Particle Swarm Optimization (PSO) and Differential Evolution (DE). It is incorporated into cooperative group optimization (CGO) system [2]. The DEPSO paper has been cited over 400 times with various applications. DEPSO was also implemented (by Sun

Read More

  • 0

Particle Swarm Optimization (PSO) Software

Particle swarm optimization (PSO) is a population-based stochastic optimization technique inspired by swarm intelligence. The underlying motivation for the development of PSO algorithm was social behavior of animals such as bird flocking, fish schooling, and swarm theory. The fundamental to the development of PSO is a hypothesis that social sharing of information among peers offers an evolutionary

Read More

  • 0

Polymath8: Bounded Gaps between Primes

The Polymath8 project, led by the Fields Medalist Dr. Terence Tao and in collaboration with a team of top mathematicians, was launched to optimize the records of the bounded gaps between primes based on the breakthrough work of “Bounded gaps between primes” by Dr. Yitang Zhang. He proved that there are infinitely many pairs of primes with a

Read More