• DocumentCode
    603437
  • Title

    Neighborhood Hybrid Structure for Minimum Spanning Tree Problem

  • Author

    Bahena, B.M. ; Cruz-Chavez, Marco A. ; Diaz-Parra, O. ; Rangel, M.G.M. ; Rosales, M.H.C. ; Del Carmen Peralta Abarca, J. ; Chavez, J.Y.J.

  • Author_Institution
    Postgrado en Ing. y Cienc., Univ. Autonoma del Estado de Morelos, Cuernavaca, Mexico
  • fYear
    2012
  • fDate
    19-23 Nov. 2012
  • Firstpage
    191
  • Lastpage
    196
  • Abstract
    An experimental analysis of five neighborhoods is presented. The analysis includes a hybrid structure comprised of one random pair, two random pairs, three random pairs or four random pairs. The efficiency and effectiveness of each structure was tested using the minimum spanning tree problem. As proposed in this research paper, the hybrid structure approach applied to the minimum spanning tree problem demonstrates superior effectiveness and competitive efficiency as compared to other structures.
  • Keywords
    random processes; trees (mathematics); MST; minimum spanning tree problem; neighborhood hybrid structure testing; random pair; graph; local search; neighbor vertex; permutation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electronics, Robotics and Automotive Mechanics Conference (CERMA), 2012 IEEE Ninth
  • Conference_Location
    Cuernavaca
  • Print_ISBN
    978-1-4673-5096-9
  • Type

    conf

  • DOI
    10.1109/CERMA.2012.38
  • Filename
    6524577
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=603437