Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm

DOI10.1016/S0305-0548(98)00035-5zbMath0933.90048MaRDI QIDQ1302732

Ralf Oestermark

Publication date: 4 April 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

genetic algorithmbilinear constraintstrim lossgenetic hybrid algorithmnonconvex mixed integer nonlinear programmingpaper-converting mill

Mathematics Subject Classification ID

Nonlinear programming (90C30) Case-oriented studies in operations research (90B90)

Related Items

Analysis of uncontrollable supply effects on a co-production demand-driven wood remanufacturing mill with alternative processes ⋮ Designing a superstructure for parametric search for optimal search spaces in non‐trivial optimization problems ⋮ A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems ⋮ Trim loss optimization by an improved differential evolution ⋮ A flexible platform for mixed‐integer non‐linear programming problems ⋮ Concurrent processing of mixed‐integer non‐linear programming problems ⋮ Dynamic portfolio management under competing representations ⋮ The stochastic trim-loss problem ⋮ Scalability of the genetic hybrid algorithm on a parallel supercomputer ⋮ An application of swarm optimization to nonlinear programming ⋮ Genetic algorithm solution for a risk-based partner selection problem in a virtual enterprise