Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems

DOI10.1108/03684920210417319zbMath1021.90027OpenAlexW2057138519MaRDI QIDQ4781560

Ralf Oestermark

Publication date: 13 November 2002

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684920210417319

zbMATH Keywords

nonlinear optimizationparametric searchgenetic hybrid algorithm

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Search theory (90B40)

Related Items

Concurrent processing of mixed‐integer non‐linear programming problems ⋮ Dynamic portfolio management under competing representations ⋮ Scalability of the genetic hybrid algorithm on a parallel supercomputer

Uses Software

• MINOS
• Scatter Search

Cites Work

• Solving irregular econometric and mathematical optimization problems with a genetic hybrid algorithm
• Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
• A distributed parallel genetic algorithm for solving optimal growth models
• Heuristic methods for evolutionary computation techniques
• A flexible multicomputer algorithm for elementary matrix operations
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• Solving a linear multiperiod portfolio problem by interior-point methodology
• A hybrid genetic fuzzy neural network algorithm designed for classification problems involving several groups