Adaptive Search for Optimum in a Problem of Oil Stabilization Process Design

  • A. Žilinskas
  • E. S. Fraga
  • A. Mackutė
  • A. Varoneckas


The formulation of a model for an industrial problem in process design leads to an optimization problem with a small, implicitly defined, feasible region, a region which is difficult to identify a priori. The difficulties of obtaining a good solution with conventional optimization methods are discussed. A novel method is proposed, based on the paradigm of evolutionary computing and a two stage search: the first stage aims to find a set of points covering the feasible region and the second stage is a search for the optimum, modelling the evolution of the population, the set of points, found in the first stage. The results of profit optimization for an industrial case study are presented.


Genetic Algorithm Feasible Region Minimum Span Tree Feasible Point Trial Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Törn and A. Žilinskas. Global optimization. Lecture Notes in Computer Science, 350:1–255, 1989.CrossRefGoogle Scholar
  2. [2]
    Z. Michalevich. Genetic Algorithms + Data Structures = Evolution Programs. Springer, NY, 1996.Google Scholar
  3. [3]
    H.-P. Schwefel. Numerical Optimization of Computer Models. J.Wiley, NY, 1981.MATHGoogle Scholar
  4. [4]
    I. Parmee. Evolutionary and Adaptive Computing in Engineering Design. Springer, NY, 2001.CrossRefGoogle Scholar
  5. [5]
    J. E. Smith. Genetic algorithms. In Panos M. Pardalos and H. Edwin Romeijn, editors, Handbook of Global Optimization Volume 2, Nonconvex optimization and its applications, pages 275–362. Kluwer Academic Publishers, 2002.Google Scholar
  6. [6]
    K. Miettinen, M. Mäkelä, and J. Toivanen. Numerical comparison of some penalty-based constrainet handling techniques in genetic algorithms. Journal of Global Optimization, 27:427–446, 2003.MATHCrossRefGoogle Scholar
  7. [7]
    R. Smith. Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Operations Research, 32:1296–1308, 1984.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    E. McCarthy, E. S. Fraga, and J. W. Ponton. An automated procedure for multi-component product separation synthesis. Computers & Chemical Engineering, 22(7):S77–S84, 1998.CrossRefGoogle Scholar
  9. [9]
    K. Wang, A. Salhi, and E. S. Fraga. Process design optimisation using embedded hybrid visualisation and data analysis techniques within a genetic algorithm optimisation framework. Chemical Engineering and Processing, 43(5):657–669, 2004.CrossRefGoogle Scholar
  10. [10]
    M. Gen and R. Cheng. Genetic Algorithms and Engineering Optimization. J. Wiley, NY, 2000.Google Scholar
  11. [11]
    L. Kocis and W. Whiten. Computational investigation of low-discrepancy sequences. ACM Trans. on Mathematical Software, 23:266–294, 1997.MATHCrossRefGoogle Scholar
  12. [12]
    E. S. Fraga, K. Wang, and A. Salhi. Interactivity and automated process design. Chemical Engineering Technology, 26(8):823–827, 2003.CrossRefGoogle Scholar
  13. [13]
    P. J. M. van Laarhoven and E. H. L. Aarts. Simulated annealing: Theory and applications. Kluwer Academic Publishers (Dordrecht), 1987.Google Scholar

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • A. Žilinskas
    • 1
    • 2
  • E. S. Fraga
    • 3
  • A. Mackutė
    • 1
  • A. Varoneckas
    • 1
  1. 1.Vytautas Magnus UniversityKaunasLithuania
  2. 2.School of MathematicsCardiff UniversityCardiffUK
  3. 3.Centre for Process Systems Engineering Department of Chemical EngineeringUCL (University College London)LondonUK

Personalised recommendations