A novel heuristic algorithm for the classical single-row routing problem is presented. The algorithm is based on a graph-theoretic decomposition scheme and uses modified cut-numbers. The algorithm was implemented in C on VAX 8200. The experimental results show that the quality of solutions generated by the proposed algorithm could be up to 36% better than that generated by existing algorithms.
ASJC Scopus subject areas
- Hardware and Architecture
- Control and Systems Engineering