SUMMARYIn this paper the authors propose a structural method for a genetic algorithm (GA) for the optimization problem of cable routing in which cables have to be laid optimally. When there are no limits on the layout routes, the optimal routes for the individual cables can be found using the Dijkstra method in a finite discrete graph. However, when there are limits on the capacity in the layout routes, optimization cannot be performed using the Dijkstra method. The proposed GA is a two-level hierarchical GA that uses chromosome coding involving two levels. The routes for each cable and the combinations of cable routes are defined respectively, and layout route selection is optimized overall through genetic operations involving these levels. Block crossover and block mutation are used as genetic operations in the first level. In addition, a method to take advantage of lethal genes, which do not satisfy the constraints and are generated in the second level is used. Computer simulations confirm that the two-level hierarchical GA with these genetic operations functions effectively for the optimization problem of cable routing.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.