Genetic Algorithm for Restrictive Channel Routing Problem

This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem consists of the use of information about horizontal and vertical constraints in chromosome encoding that allow prevention of “illegal” solutions. This representation leads to lower complexity, because solution repairing procedures become unnecessary. Moreover, the search space is greatly reduced. Competitive experimental results proving the consistency of the approach were obtained. 

• Type: Conference
• Year: 1997
• Where: ICGA
• Authors: Vladimir N. Davidenko, Victor M. Kureichik, Victor V. Miagkikh
• Keywords: Channel Routing Problem, Genetic Algorithms, ICGA 1997, Optimization, Solution Repairing Procedures