2009 World Congress on Nature &Amp; Biologically Inspired Computing (NaBIC) 2009
DOI: 10.1109/nabic.2009.5393443
|View full text |Cite
|
Sign up to set email alerts
|

A java library for genetic algorithms addressing memory and time issues

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Some computational tools for this purpose already exist to reduce heuristic development complexity and make them more generic. Among the available tools are: iOPT (Voudouris et al, 2001), EO (Keijzer et al, 2001), JEO (Arenas et al, 2002), Hot-Frame (Fink and Voß, 2002), HeuristicLab (Wagner and Affenzeller, 2005), EasyLocal ++ (Di Gaspero and Schaerf, 2003), ParadisEO (Cahon et al, 2004), JCLEC (Ventura et al, 2008), OPT4J (Lukasiewycz et al, 2011), MDF (Lau et al, 2007) and Jenes (Troiano and Pasquale, 2010). These tools have in common the goal of reusing code by providing implemented common parts in metaheuristic developments.…”
Section: Tabu Searchmentioning
confidence: 99%
“…Some computational tools for this purpose already exist to reduce heuristic development complexity and make them more generic. Among the available tools are: iOPT (Voudouris et al, 2001), EO (Keijzer et al, 2001), JEO (Arenas et al, 2002), Hot-Frame (Fink and Voß, 2002), HeuristicLab (Wagner and Affenzeller, 2005), EasyLocal ++ (Di Gaspero and Schaerf, 2003), ParadisEO (Cahon et al, 2004), JCLEC (Ventura et al, 2008), OPT4J (Lukasiewycz et al, 2011), MDF (Lau et al, 2007) and Jenes (Troiano and Pasquale, 2010). These tools have in common the goal of reusing code by providing implemented common parts in metaheuristic developments.…”
Section: Tabu Searchmentioning
confidence: 99%
“…(1). Optimization was implemented using the framework Jenes (Troiano and De Pasquale, 2009), in order to make a direct comparison between GP and GA convergence as both algorithms are supported and implementation does not affect experimental results. We run the algorithm 5 times with different population size (100, 200, 500 and 1000 individuals) in order to limit the effect of randomness in studying and comparing convergence.…”
Section: Experimentationmentioning
confidence: 99%
“…population size, generation limit, cross-over probability, etc. ), whose implementation uses an open source optimized library for genetic algorithms written in Java (Troiano and De Pasquale, 2009). Besides controls to run the page adaptation, the user is able to perform a quantitative test of the algorithm in order to check performances and convergence.…”
Section: A Tool For Automatic Adaptationmentioning
confidence: 99%