• DocumentCode
    2646447
  • Title

    Low-level Teamwork Hybridization for P-metaheuristics: A review and comparison

  • Author

    Masrom, S. ; Abidin, Siti Z Z ; Hashimah, P.N. ; Rahman, S.A.S.A.

  • Author_Institution
    Fac. of Comput. & Math. Sci., Univ. Teknol. MARA, Shah Alam, Malaysia
  • fYear
    2011
  • fDate
    28-29 June 2011
  • Firstpage
    128
  • Lastpage
    133
  • Abstract
    Inspired by nature, many types of Population based metaheuristics or P-metaheuristics is cropping out of research labs to help solve real life problems. Since every metaheuristics has its own strength and weaknesses, hybridizing the algorithms can sometimes produce better results. To this date of literature, Low-level Teamwork Hybridization is considered as an effective and popular method for hybridization of P-metaheuristics. In many cases however, the approach might prove to be quite complicated. The hybridization often requires metaheuristics internal structure modification in order for the different algorithms to fit well together. Another difficulty is in determining which strategies to be retained and which to be dropped or replaced in each of the metaheuristic algorithms. This paper provides a general abstraction for P-metaheuristics and describes the main P-metaheuristics components that are suitable candidates for hybridization. The review and comparative study of several implementations of Low-level Teamwork Hybridization is also presented.
  • Keywords
    operations research; optimisation; P-metaheuristics; low-level teamwork hybridization; population based metaheuristics; Benchmark testing; Genetic algorithms; Optimization; Particle swarm optimization; Search problems; Teamwork; Low-level Teamwork Hybridization; P-metaheuristics; Population generation; Population initialization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining and Optimization (DMO), 2011 3rd Conference on
  • Conference_Location
    Putrajaya
  • ISSN
    2155-6938
  • Print_ISBN
    978-1-61284-211-0
  • Electronic_ISBN
    2155-6938
  • Type

    conf

  • DOI
    10.1109/DMO.2011.5976516
  • Filename
    5976516