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

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