Skip to content
DEPSO is an algorithm for (constrained) numerical optimization problem.
Branch: master
Clone or download
Pull request Compare This branch is 18 commits ahead, 2 commits behind wiomax:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.
image None Oct 18, 2017
lib None Apr 4, 2018
src/problem None Feb 15, 2018
.gitignore None Apr 2, 2018


DEPSO, or called DEPS, is an optimization algorithm hybridizing the advantages of Particle Swarm Optimization (PSO) and Differential Evolution (DE). It can be incorporated into cooperative group optimization (CGO) system.

The DEPSO paper has been cited over 400 times with various applications. DEPSO was also implemented (by Sun Microsystems Inc.) into NLPSolver (Solver for Nonlinear Programming), an extension of Calc in Apache OpenOffice.

Problem to be Solved

It solves (constrained) numerical optimization problem (NOP) as

where f(x) is the objective function and each g(x) is a constraint function to be satisfied, and c and d are constants. All the functions can be nonlinear and nonsmooth.

General information

Portal: E-MAIL: Xiao-Feng Xie

Version History

Current: The mini Series V1.00.04 (Java) with the DEPSO implementation

Quick start

  • Execute: Enter the directory "myprojects", then run the file "examples.bat".

  • Compile: Type "ant" to build, and the output file will be dist/depso.jar.

  • See src/problem for examples of constrain and unconstrained problem instances.

License description

See the Creative Commons Non-Commercial License 3.0 for more details.

Please acknowledge the author(s) if you use this code in any way.

You can’t perform that action at this time.