• DocumentCode
    1179116
  • Title

    An Improved Tabu Search for Economic Dispatch with Multiple Minima

  • Author

    Lin, W. M. ; Cheng, F. S. ; Tsay, M. T.

  • Author_Institution
    National Sun Yat-Sen University, Taiwan; Cheng-Shiu Institute of Technology
  • Volume
    22
  • Issue
    1
  • fYear
    2002
  • Firstpage
    70
  • Lastpage
    70
  • Abstract
    This paper develops an improved tabu search algorithm (ITS) for economic dispatch (ED) with noncontinuous and nonsmooth cost functions. ITS employs a flexible memory system to avoid the entrapment in a local minimum, and developed the ideal of "distance" to the fitness to accelerate optimization. The new approach extends simple tabu search algorithm (STS) to real valued optimization problem, and applies parallelism to weaken the dependence of the convergence rate of modified tabu search algorithm (MTS) on the initial condition. Effectiveness of the method was compared with many conventional methods. Results show that the proposed algorithm can provide accurate solutions with reasonable performance, and has a great potential for other applications in the power system.
  • Keywords
    Acceleration; Cost function; Genetic algorithms; Genetic programming; Power generation economics; Power system economics; Power systems; Sociotechnical systems; Economic dispatch; a move; adaptive progressing scheme; aspiration criteria; evolutionary programming; improved tabu search; modified tabu search; recombination; simple tabu search; tabu restrictions;
  • fLanguage
    English
  • Journal_Title
    Power Engineering Review, IEEE
  • Publisher
    ieee
  • ISSN
    0272-1724
  • Type

    jour

  • DOI
    10.1109/MPER.2002.4311692
  • Filename
    4311692