Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems

DOI10.1007/978-3-540-72960-0_14zbMath1211.90143OpenAlexW1518978513MaRDI QIDQ3509441

Antonin Ponsich, Serge Domenech, Catherine Azarro-Pantel, Lue Pibouleau

Publication date: 1 July 2008

Published in: Natural Computing Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72960-0_14

zbMATH Keywords

genetic algorithmconstraint handlingelimination techniquestorage tankMINLP problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A mixed-discrete particle swarm optimization algorithm with explicit diversity-preservation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Greedy random adaptive memory programming search for the capacitated clustering problem
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• An efficient constraint handling method for genetic algorithms
• Evolution strategies. A comprehensive introduction
• A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
• Review of nonlinear mixed-integer and disjunctive programming techniques
• An evolutionary programming algorithm for continuous global optimization
• Tabu search directed by direct search methods for nonlinear global optimization
• An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization

This page was built for publication: Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems