Paradiseo

Paradiseo

infobox software



caption =
latest_release_version = 1.0
latest_release_date = release date|2007|10|12
developer = [http://www.inria.fr/recherche/equipes/dolphin.en.html DOLPHIN project-team] of INRIA
operating_system = Cross-platform
genre = Technical computing
license = CeCill license
website = http://paradiseo.gforge.inria.fr

ParadisEO is a white-box object-oriented framework dedicated to the flexible design of metaheuristics. This template-based, ANSI-C++ compliant computation library is portable across both Windows system and sequential platforms (Unix, Linux, Mac OS X, etc.). ParadisEO is distributed under the CeCill license and can be used under several environments.

Overview

ParadisEO is a white-box object-oriented framework dedicated to the reusable design of metaheuristics, hybrid metaheuristics, and parallel and distributed metaheuristics.ParadisEO provides a broad range of features including evolutionary algorithms, local searches, Particle swarm optimization, the most common parallel and distributed models and hybridization mechanisms, etc. This high content and utility encourages its use at International level. ParadisEO is based on a clear conceptual separation of the solution methods from the problems they are intended to solve. This separation confers to the user a maximum code and design reuse. Furthermore, the fine-grained nature of the classes provided by the framework allow a higher flexibility compared to other frameworks. ParadisEO is of the rare frameworks that provide the most common parallel and distributed models. Their implementation is portable on distributed-memory machines as well as on shared-memory multiprocessors, as it uses standard libraries such as MPI, PVM and PThreads. The models can be exploited in a transparent way, one has just to instantiate their associated provided classes. Their experimentation on the radio network design real-world application demonstrate their efficiency.

Modules

Paradiseo-EO

Paradiseo-EO deals with population based metaheuristics, it is a templates-based, ANSI-C++ compliant evolutionary computation library (evolutionary algorithms, particle swarm optimization...). It contains classes for almost any kind of evolutionary computation you might come up to - at least for the ones we could think of. It is component-based, so that if you don't find the class you need in it, it is very easy to subclass existing abstract or concrete classes.

Paradiseo-MOEO

Paradiseo-MOEO provides a broad range of tools for the design of multiobjective optimization metaheuristics: fitness assignment shemes (achievement functions, ranking, indicator-based...), diversity preservation mechanisms (sharing, crowding), elitism, performance metrics (contribution, entropy...), statistical tools and some easy-to-use stat-of-the-art multi-objective evolutionary algorithms (NSGA, NSGA-II, IBEA...).

Paradiseo-MO

Paradiseo-MO deals with single-solution based metaheuristics, it provides tools for the development of single solution-based metaheuristics: Hill climbing,Tabu search, iterative local search (ILS), Simulated annealing, incremental evaluation, partial neighbourhood...

Paradiseo-PEO

Paradiseo-PEO provides tools for the design of parallel and distributed metaheuristics: parallel evaluation, parallel evaluation function, island model, cellular model... Paradiseo-PEO also introduces tools for the design of distributed, hybrid and cooperative models.

Team

* Jean-Charles Boisson
* Clive Canape
* Laetitia Jourdan
* Thomas Legrand
* Arnaud Liefooghe
* Nouredine Melab
* El-Ghazali Talbi
* Alexandru-Adrian Tantar

Download

Download ParadisEO from [http://paradiseo.gforge.inria.fr/index.php?n=Paradiseo.Download here] .

See also

* [http://paradiseo.gforge.inria.fr Official site] , at "Paradiseo" website
* [http://www.inria.fr/recherche/equipes/dolphin.en.html Team] , at DOLPHIN project-team website

References

* [http://doi.ieeecomputersociety.org/10.1109/CCGRID.2006.172 |"Solving the Protein Folding Problem with a Bicriterion Genetic Algorithm on the Grid"]
* Protein Sequencing with an Adaptive Genetic Algorithm from Tandem Mass Spectrometry, CEC 2006, 0-7803-9489-5, July 16-21 2006, pp 1412-1419, Vancouver, Canada
* [http://www2.lifl.fr/~jourdan/publi/jourdan_EMO07_A.pdf|"ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization"]
* A Multi-Objective Approach to the Design of Conducting Polymer Composites for Electromagnetic Shielding, EMO 2007, Matsushima, Japan
* A hybrid metaheuristic for knowledge discovery in microarray experiments, In Handbook of Bioinspired Algorithms and Applications, Edited by S. Olariu and A.Y. Zomaya
* [http://top25.sciencedirect.com/index.php?cat_id=9&subject_area_id=7&journal_id=07437315| Grid computing for parallel bioinspired algorithms]
* [http://www.springerlink.com/content/up02m74726v1526u/|ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics]
* [http://dx.doi.org/10.1016/j.comcom.2006.08.017| Designing cellular networks using a parallel hybrid metaheuristic]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Paradiseo — Développeur INRIA Dernière version …   Wikipédia en Français

  • Simulated annealing — (SA) is a generic probabilistic meta algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g.,… …   Wikipedia

  • Local search (optimization) — In computer science, local search is a metaheuristic for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate… …   Wikipedia

  • Particle swarm optimization — (PSO) is a swarm intelligence based algorithm to find a solution to an optimization problem in a search space, or model and predict social behavior in the presence of objectives.OverviewParticle swarm optimization is a stochastic, population… …   Wikipedia

  • Hill climbing — In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is relatively simple to implement, making it a popular first choice. Although more advanced algorithms may give better… …   Wikipedia

  • Tabu search — is a mathematical optimization method, belonging to the class of local search techniques. Tabu search enhances the performance of a local search method by using memory structures: once a potential solution has been determined, it is marked as… …   Wikipedia

  • Multiobjective optimization — Multi objective optimization (or programming), [cite book|last = Steuer|first = R.E.|title = Multiple Criteria Optimization: Theory, Computations, and Application|publisher = John Wiley Sons, Inc|date = 1986|location = New York|isbn = 047188846X] …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • Cmake — Développeurs Andy Cedilnik, Bill Hoffman, Brad King, Ken Martin, Alexander Neundorf …   Wikipédia en Français

  • Recherche locale — En informatique, la recherche locale est une métaheuristique utilisée pour résoudre des problèmes d optimisation difficiles. La recherche locale peut être utilisée sur des problèmes de recherche d une solution maximisant un critère parmi un… …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”