A C++ application programming interface for biased random-key genetic algorithms

Optimization Methods and Software

Volumn 30, Issue 1, 2015, Pages 81-93

  Toso, R F ^a   Resende, M G C ^b  

^a RUTGERS UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

application programming interface; biased random key genetic algorithms; combinatorial optimization; genetic algorithms; parallel programming

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMMING INTERFACES (API); C++ (PROGRAMMING LANGUAGE); COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; HIGH LEVEL LANGUAGES; OPTIMIZATION; PARALLEL PROGRAMMING; PROBLEM ORIENTED LANGUAGES;

ALGORITHMIC FRAMEWORK; CROSS-PLATFORM; EVOLUTIONARY DYNAMICS; OBJECT ORIENTED APPLICATION; OPTIMIZATION PROBLEMS; POPULATION MANAGEMENT; RANDOM KEYS; SHARED MEMORY PARALLELISM;

OBJECT ORIENTED PROGRAMMING;

EID: 84920738745     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2014.890197     Document Type: Article

References (22)

1. J. Bean, Genetic algorithms and random keys for sequencing and optimization, ORSA J. Comput. 2 (1994), pp. 154-160.
2. H.G. Beyer and H.P. Schwefel, Evolution strategies: a comprehensive introduction, Nat. Comput. 1 (2002), pp. 3-52.
3. L. Buriol, M. Hirsch, T. Querido, P. Pardalos, M. Resende, and M. Ritt, A biased random-key genetic algorithm for road congestion minimization, Optim. Lett. 4 (2010), pp. 619-633.
4. J. Gonçalves and M. Resende, Biased random-key genetic algorithms for combinatorial optimization, J. Heuristics 17 (2011), pp. 487-525.
5. J. Gonçalves and M. Resende, A parallel multi-population biased random-key genetic algorithm for a container loading problem, Comput. Oper. Res. 29 (2012), pp. 179-190.
6. J. Gonçalves, J. Mendes, and M. Resende, A random key based genetic algorithm for the resource constrained project scheduling problems, Comput. Oper. Res. 36 (2009), pp. 92-109.
7. J. Gonçalves, M. Resende, and J. Mendes, A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem, J. Heuristics 17 (2011), pp. 467-486.
8. J. Hesser and R. Manner, Towards an optimal mutation probability for genetic algorithms, in Parallel Problem Solving from Nature, H.P. Schwefel and R. Manner, eds., Lecture Notes in Computer Science, Vol. 496, Springer, Berlin, 1991, pp. 23-32.
9. M.Keijzer, J. Merelo, G. Romero, and M. Schoenauer, Evolving objects: a general purpose evolutionary computation library, Artif. Evol. 2310 (2002), pp. 829-888.
10. M. Luby, A. Sinclair, and D. Zuckerman, Optimal speedup of Las Vegas algorithms, Inform. Process. Lett. 47 (1993), pp. 173-180.
11. M. Matsumoto and T. Nishimura, Mersenne Twister: a 623-dimensionally equidistributed uniform pseudorandom number generator, ACM Trans. Model. Comput. Simul. 8 (1998), pp. 3-30.
12. K. Meffert, JGAP-Java genetic algorithms and genetic programming package. Available at: http://jgap.sf.net (accessed on 26 July 2011).
13. M. Musnjak and M. Golub, Using a set of elite individuals in a genetic algorithm, in 26th International Conference on Information Technology Interfaces, IEEE, Silver Spring, MD, 2004, pp. 531-535.
14. T. Noronha, M. Resende, and C. Ribeiro, A biased random-key genetic algorithm for routing and wavelength assignment, J. Global Optim. 50 (2011), pp. 503-518.
15. OpenMP. Available at: http://openmp.org (accessed on 8 August 2011).
16. C. Reeves, Genetic algorithms, in Handbook of Metaheuristics, 2nd ed., International Series in Operations Research & Management Science, Vol. 146, Springer, Berlin, 2010, pp. 109-139.
17. R. Reis, M. Ritt, L. Buriol, and M. Resende, A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion, Int. Trans. Oper. Res. 18 (2011), pp. 401-423.
18. M. Resende, Biased random-key genetic algorithms with applications in telecommunications, TOP 20 (2012), pp. 130-153.
19. M. Resende, R. Toso, J. Gonçalves, and R. Silva, A biased random-key genetic algorithm for the Steiner triple covering problem, Optim. Lett. 6 (2012), pp. 605-619.
20. W. Spears and K. DeJong, On the virtues of parameterized uniform crossover, in Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Francisco, CA, 1991, pp. 230-236.
21. B. Stroustrup, The C++ Programming Language, 3rd ed., Addison-Wesley Professional, Reading, MA, 2000.
22. D. Whitley, S. Rana, and R. Heckendorn, The island model genetic algorithm: on separability, population size and convergence, J. Comput. Inform. Technol. 7 (1998), pp. 33-47.