Hanging Bridge Algorithm for Pipe-Routing Design in Ship Engine Room

2008 ◽  
Author(s):  
Lu Huibiao ◽  
Yu Zhefu ◽  
Sun Peiting
Keyword(s):  
Engine Room ◽  
Routing Design ◽  
Pipe Routing

A survey of pipe routing design

2008 ◽  
Author(s):  
Xiao-long Qian ◽  
Tao Ren ◽  
Cheng-en Wang
Keyword(s):  
Routing Design ◽  
Pipe Routing

Ship Pipe Routing Design Using the ACO with Iterative Pheromone Updating

2007 ◽  
Vol 23 (01) ◽  
pp. 36-45 ◽  
Author(s):  
Fan Xiaoning ◽  
Lin Yan ◽  
Ji Zhuoshang
Keyword(s):  
Ant Colony Algorithm ◽  
Optimization Problems ◽  
Dimensional Space ◽  
Three Dimensional ◽  
Stochastic Search ◽  
Ant Colony ◽  
Pipe Material ◽  
Combinatorial Optimization Problems ◽  
Routing Design ◽  
Pipe Routing

Ship pipe routing design (SPRD) that belongs to non-deterministic polynomial (NP)-hard problem concerns minimizing the cost of pipe material while satisfying constraints and avoiding obstacles. Currently, this total solution mainly depends on human experts. The stochastic search algorithms suitable for computer technology provide the opportunity to automate and optimize it. The Ant Colony Optimization (ACO) is an effective metaheuristic and stochastic search technique to solve combinatorial optimization problems by using principle of pheromone information. Based on ACO, the method of ant colony algorithm with iterative pheromone updating is first proposed to solve ship pipeline routing in three-dimensional space. Simulation results show that the new updating approach of pheromone is feasible and effective. Mean-while, the performance and computer processing time of the proposed algorithm outperform the original ACO used to generate SPRD solutions.

Sign in / Sign up

Export Citation Format

Share Document