• DocumentCode
    303928
  • Title

    A new hybrid algorithm for the over-the-cell routing problem

  • Author

    Yurdakul, Arda ; Dündar, Günhan

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Bogazici Univ., Istanbul, Turkey
  • Volume
    1
  • fYear
    1996
  • fDate
    13-16 May 1996
  • Firstpage
    480
  • Abstract
    In this study, a new hybrid linear integer programming-heuristic algorithm for over the cell routing is proposed. Time consumption for the solution of a linear integer program is strongly dependent on the dimension of the matrix formed by constraints and variables. The new hybrid algorithm makes use of heuristic methods to decrease dimension of the matrix. The performance of the new method is compared with the previous results of linear integer programming methods and conventional heuristic methods
  • Keywords
    heuristic programming; integer programming; linear programming; network routing; hybrid linear integer programming-heuristic algorithm; matrix dimensions; over-the-cell routing; Ambient intelligence; Heuristic algorithms; Integer linear programming; Routing; Very large scale integration; Wire;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electrotechnical Conference, 1996. MELECON '96., 8th Mediterranean
  • Conference_Location
    Bari
  • Print_ISBN
    0-7803-3109-5
  • Type

    conf

  • DOI
    10.1109/MELCON.1996.551584
  • Filename
    551584
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=303928