A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm

DOI10.1007/S10878-013-9659-ZzbMath1331.90055OpenAlexW2066587723WikidataQ121028198 ScholiaQ121028198MaRDI QIDQ498446

Ricardo M. A. Silva, Panos M. Pardalos, Mauricio G. C. Resende

Publication date: 28 September 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9659-z

zbMATH Keywords

global optimizationnonlinear programmingheuristicstochastic algorithmstochastic local searchcontinuous optimizationbiased random-key genetic algorithmmultimodal functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (2)

On computing the path number of a graph ⋮ libbrkga

Uses Software

• SymPy
• MersenneTwister
• Autotools
• Python
• Autoconf

Cites Work

• Unnamed Item
• A biased random-key genetic algorithm for the Steiner triple covering problem
• Speeding up continuous GRASP
• A genetic algorithm for the weight setting problem in OSPF routing
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• Biased random-key genetic algorithms with applications in telecommunications
• Global optimization by continuous grasp
• Mersenne twister
• Genetic Algorithms and Random Keys for Sequencing and Optimization

This page was built for publication: A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm