• DocumentCode
    1832805
  • Title

    Particle Swarm Optimization algorithm for optimization of utility systems in chemical processes

  • Author

    Dai, Wenzhi ; Mu, Lin ; Yin, Hongchao ; Lam, Wei-Haur

  • Author_Institution
    Sch. of Mech. Eng., Liaoning Tech. Univ., Fuxin, China
  • fYear
    2010
  • fDate
    7-10 Dec. 2010
  • Firstpage
    1999
  • Lastpage
    2003
  • Abstract
    Different techniques for the optimization of utility systems have been developed in recent decades. The objective of this paper is to introduce a new mathematical programming model applied to the operational optimization for the utility system. Particle Swarm Optimization (PSO) presented by Kennedy has been described for solving mixed integer linear programming (MILP). It is a simple algorithm that seems to be effective for optimizing a wide range of functions, which a few parameters can be implemented easily. The case of utility system for the chemical process is also formulated as a MILP model where the mass and energy balances, the operational status of each unit, and the demand satisfaction of steam and electricity are defined. The target of the model is to minimize the utility costs. Current results are proved to be reliable, which implied that the current method is more effective and robust compared to the conventional method.
  • Keywords
    chemical industry; demand forecasting; linear programming; load forecasting; particle swarm optimisation; steam; utility theory; chemical process; demand satisfaction; electricity; mathematical programming; mixed integer linear programming; particle swarm optimization; steam; utility system; Chemical engineering; Electricity; Equations; Mathematical model; Optimization; Particle swarm optimization; Turbines; PSO algorithm; energy conservation; optimization; utility system;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Engineering and Engineering Management (IEEM), 2010 IEEE International Conference on
  • Conference_Location
    Macao
  • ISSN
    2157-3611
  • Print_ISBN
    978-1-4244-8501-7
  • Electronic_ISBN
    2157-3611
  • Type

    conf

  • DOI
    10.1109/IEEM.2010.5674650
  • Filename
    5674650