Proceedings of the 1996 8th Mediterranean Electrotechnical Conference, MELECON'06. Part 3 (of 3), Bari, İtalya, 13 - 16 Mayıs 1996, cilt.1, ss.480-483, (Tam Metin Bildiri)
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.