An elite decision making harmony search algorithm for optimization problem (Q1760872): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An improved harmony search algorithm for solving optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global-best harmony search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel derivative of harmony search algorithm for discrete design variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adaptive global best harmony search algorithm for continuous optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the sum-of-ratios problems by a harmony search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Descent from Local Minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421356 / rank
 
Normal rank

Latest revision as of 21:40, 5 July 2024

scientific article
Language Label Description Also known as
English
An elite decision making harmony search algorithm for optimization problem
scientific article

    Statements

    An elite decision making harmony search algorithm for optimization problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    Summary: This paper describes a new variant of harmony search algorithm which is inspired by a well-known item ``elite decision making.'' In the new algorithm, the good information captured in the current global best and the second best solutions can be well utilized to generate new solutions, following some probability rule. The generated new solution vector replaces the worst solution in the solution set, only if its fitness is better than that of the worst solution. The generating and updating steps and repeated until the near-optimal solution vector is obtained. Extensive computational comparisons are carried out by employing various standard benchmark optimization problems, including continuous design variables and integer variables minimization problems from the literature. The computational results show that the proposed new algorithm is competitive in finding solutions with the state-of-the-art harmony search variants.
    0 references
    0 references
    harmony search algorithm
    0 references
    integer variables minimization problems
    0 references
    0 references
    0 references
    0 references
    0 references