Competent genetic algorithms for weighing matrices

DOI10.1007/s10878-011-9404-4zbMath1261.90046OpenAlexW2171624691MaRDI QIDQ1928508

Panos M. Pardalos, Dimitris E. Simos, Ilias S. Kotsireas, Christos Koukouvinos

Publication date: 3 January 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-011-9404-4

zbMATH Keywords

optimizationweighing matricesmessy genetic algorithmcompetent metaheuristicsfast messy genetic algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics ⋮ A hybrid biased random key genetic algorithm approach for the unit commitment problem

Cites Work

• A modified power spectral density test applied to weighing matrices with small weight
• Periodic complementary binary sequences and combinatorial optimization algorithms
• Weighing matrices and string sorting
• An efficient string sorting algorithm for weighing matrices of small weight
• New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review
• Weighing matrices and their applications
• Quantum algorithms for weighing matrices and quadratic residues
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• Further explorations into ternary complementary pairs
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Self-dual codes over F/sub p/ and weighing matrices
• Evolutionary Multi-Criterion Optimization
• Some Improvements in Weighing and Other Experimental Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Competent genetic algorithms for weighing matrices