You can view the full text of this article for free using the link below.

Title: Research on the cable routing optimisation by hybrid intelligent water drop algorithm

Authors: Chunquan Li; Ming Zhang; Yuling Shang; Yuwei Hu

Addresses: School of Electromechanical Engineering, Guilin University of Electronic Technology, Guilin, 541004, China; Guangxi Key Laboratory of Manufacturing System and Advanced Manufacturing Technology, Guilin, 541004, China ' School of Electromechanical Engineering, Guilin University of Electronic Technology, Guilin, 541004, China; National Demonstration Center for Experimental Electronic Circuit Education, Guilin University of Electronic Technology, Guilin, 541004, China ' School of Electronic Engineering and Automation, Guilin University of Electronic Technology, Guilin, 541004, China ' School of Electromechanical Engineering, Guilin University of Electronic Technology, Guilin, 541004, China

Abstract: Cable assembly problem is formulated as searching for cable routes and the cable routing problem is one of the most challenging optimisation problems. Cable routing is the process of searching for obstacle-free path, which is constrained by the assembly points. Before routing, the routing environment is simplified to a two-dimensional grid map for computing reduction. In order to get the optimisation routing path, a novel approach of hybrid intelligent water drop algorithm (HIWDA) for cable routing is proposed, which is the hybridisation of particle swarm optimisation (PSO) and intelligent water drop algorithm (IWDA) for global searching and local searching respectively. In addition, B-spline curves are employed for smoothing routes obtained by HIWDA and making it more practical and more feasible for assembly. The result of HIWDA is verified by comparison with other algorithms in simulation on experiments.

Keywords: cable routing; optimisation; intelligent algorithm.

DOI: 10.1504/IJMSI.2018.093910

International Journal of Materials and Structural Integrity, 2018 Vol.12 No.1/2/3, pp.208 - 223

Available online: 24 Jul 2018 *

Full-text access for editors Access for subscribers Free access Comment on this article