0 Stars
Updated Last
7 Months Ago
Started In
April 2020


Stable Dev Build Status Build Status Codecov Coveralls Build Status

This Julia package is for to solve mathematical optimisation problems of both unconstrained as well as constrained kind. The package uses the approach named Charibde in which it uses two parallel running algorithms Differential Evolution and Interval Branch & Contract algorithm to achieve solution of any difficult problem.

The package makes these two algorithms run in parallel either on same worker (processor) or on two different workers while maintaining contact with one another through channels or remotechannels.

The package also allows us to use just Interval Branch & Contract algorithm to solve the problems..

The package can also be used through JuMP syntax.


Documentation for the package is available here.

Example of some difficult problems are present in the Example folder.


  • Yashvardhan Sharma, IIT Kharagpur, West Bengal, India


  • David P. Sanders, Departamento de Física, Facultad de Ciencias, Universidad Nacional Autónoma de México (UNAM)

  • Charlie Vanaret Researcher at Fraunhofer ITWM


  • Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems by Charlie Vanaret, Jean-Baptiste Gotteland, Nicolas Durand, Jean-Marc Alliot Charibde - Archive ouverte HAL
  • Hybridisataion of evolutionary algorithms and methods of intervals for the optimization of difficult problems DOCTORATE OF THE UNIVERSITY OF TOULOUSE by Charlie Vanaret