A genetic approach to the cable harness routing problem

Author

Conru, Andrew B.

Author_Institution

Centre for Design Res., Stanford Univ., CA, USA

fYear

1994

fDate

27-29 Jun 1994

Firstpage

200

Abstract

This paper describes a system for automatically routing cable harnesses in three-dimensional environments using a pair of genetic algorithms. The cable harness routing problem (CHRP) can be formulated as a graph search problem with a large, convex search space. A genetic approach is used to intelligently and adaptively search for routings which are close to the global optimum. The CHRP is decomposed into two problems: generating a harness configuration (topology) and routing the harness in the environment. This paper defines the various genetic operators used and suggest parameter settings which quickly find routings which match the geometry of the environment

Keywords

CAD; cables (electric); genetic algorithms; graph theory; optimisation; search problems; adaptive search; automatic routing; cable harness routing problem; genetic algorithms; genetic approach; genetic operators; geometry; graph search problem; harness configuration; large convex search space; parameter settings; three-dimensional environments; Algorithm design and analysis; Assembly; Connectors; Costs; Genetic algorithms; Routing; Search problems; Solids; Wires; Wiring;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on

Conference_Location

Orlando, FL

Print_ISBN

0-7803-1899-4

Type

conf

DOI

10.1109/ICEC.1994.350016

Filename

350016