By Topic

A genetic approach to the cable harness routing problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
A. B. Conru ; Centre for Design Res., Stanford Univ., CA, USA

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

Published in:

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

Date of Conference:

27-29 Jun 1994