Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation

References

• Armillotta , A. and Mummolo , G. 1988 . A heuristic algorithm for the Steiner problem with obstacles , Bari : Dipt. di Pregettazione e Produzione Industriale, Univ. degli Studi di Bari . Technical report
   Google Scholar
• Asmara , A. and Nienhuis , U. Automatic piping system in ship . Proceedings of the 5th international conference on computer and IT applications in the maritime industries . pp. 269 – 280 . Leiden, The Netherlands
   Google Scholar
• Brassard , G. and Bratley , P. 1996 . Fundamentals of algorithmics , New Jersey, USA: Prentice Hall Press .
   Google Scholar
• Clerc , M. and Kennedy , J. 2002 . The particle swarm-explosion, stability, and convergence in a multidimensional complex space . IEEE Transactions on Evolutionary Computation , 6 ( 1 ) : 58 – 73 .
   Web of Science ®Google Scholar
• Dijkstra , E. W. 1951 . A note on two problems in connection with graphs . Numerische Mathematik , 1 : 269 – 271 .
   Google Scholar
• Fan , J. , Ma , M. and Gao , X. 2003 . Research on automatic laying out for external pipeline for aeroengine (in Chinese) . Journal of Mechanical Design , 20 ( 7 ) : 21 – 23 .
   Google Scholar
• Fan , X. , Lin , Y. and Ji , Z. The ant colony optimization for ship pipe route design in 3D space . Proceedings of the 6th World Congress on Intelligent Control and Automation . pp. 3103 – 3108 .
   Google Scholar
• Hightower , D. W. A solution to line routing problems on the continuous plane . Proceedings of Sixth Design Automation . pp. 1 – 24 . Workshop : New York, NY, USA: ACM .
   Google Scholar
• Hough , J. , Haines , R. and Giacomo , S. 2007 . Contextual factors affecting the integration of enterprise systems in post-merger oil and gas companies . Enterprise Information Systems , 1 ( 4 ) : 421 – 441 .
   Web of Science ®Google Scholar
• Hu , Y. 2006 . ACO-Steiner ant colony optimization based rectilinear Steiner minimal tree algorithm . Journal of Computer Science & Technology , 21 ( 1 ) : 147 – 152 .
   Web of Science ®Google Scholar
• Ito , T. 1999 . A genetic algorithm approach to pipe route path planning . Journal of Intelligent Manufacturing , 10 ( 1 ) : 103 – 114 .
   Web of Science ®Google Scholar
• Kang , S. S. , Myung , S. and Han , S. H. 1999 . A design expert system for auto-routing of ship pipes . Journal of Ship Production , 15 ( 1 ) : 1 – 9 .
   Google Scholar
• Kennedy , J. and Eberhart , R. C. Particle swarm optimization . Proceedings of IEEE International Conference on Neural Networks . pp. 1942 – 1948 . Piscataway, NJ : IEEE Press .
   Google Scholar
• Lawler , E. 1976 . Combinatorial optimization: networks and matroids , New York: Holt, Rinehart and Winston .
   Google Scholar
• Lee , C. Y. 1961 . An algorithm for path connections and its application . IRE Transactions on Electronic Computer, EC-10 , : 346 – 364 .
   Google Scholar
• Lozano-Pérez , T. and Wesley , M. A. 1979 . An algorithm for planning collision-free paths among polyhedral obstacles . Communications of the ACM , 22 ( 10 ) : 560 – 570 .
   Web of Science ®Google Scholar
• Luyet , L. , Varone , S. and Zufferey , N. 2007 . An ant algorithm for the Steiner tree problem in graphs . Lecture Notes in Computer Science , 4448 : 42 – 51 .
   Google Scholar
• Ma , X. and Liu , Q. A particle swarm optimization for Steiner tree problem . Proceedings of 2010 Sixth International Conference on Natural Computation (ICNC), 10–12 August 2010, Yantai, China . pp. 2561 – 2565 . New York: IEEE .
   Google Scholar
• Müller-Hannemann , M. and Tazari , S. 2010 . A near linear time approximation scheme for Steiner tree among obstacles in the plane . Computational Geometry , 43 : 395 – 409 .
   Web of Science ®Google Scholar
• O'Rourke , J. 1998 . Computational geometry in C , 2nd ed , Cambridge, England: Cambridge University Press .
   Google Scholar
• Park , J. H. and Storch , R. L. 2002 . Pipe-routing algorithm development: case study of a ship engine room design . Expert System with Applications , 23 : 299 – 309 .
   Web of Science ®Google Scholar
• Provan , J. S. 1988 . An approximation scheme for finding Steiner trees with obstacles . SIAM Journal of Computing , 17 ( 5 ) : 920 – 934 .
   Web of Science ®Google Scholar
• Roh , M. I. , Lee , K. Y. and Choi , W. Y. 2007 . Rapid generation of the piping model having the relationship with a hull structure in ship building . Advances in Engineering Software , 38 : 215 – 228 .
   Web of Science ®Google Scholar
• Van , Der Velden, C. 2007 . An intelligent system for automatic layout routing in aerospace design . Innovations in Systems and Software Engineering , 3 ( 2 ) : 117 – 128 .
   Google Scholar
• Wang , C. and Liu , Q. 2011 . “ Projection and geodesic-based pipe routing algorithm [online] ” . In In: IEEE Transactions on Automation Science and Engineering Available from: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5692867 [Accessed 20 January 2011]
   Google Scholar
• Wang , C. and Xu , L. 2008 . Parameter mapping and data transformation for engineering application integration . Information Systems Frontiers , 10 ( 5 ) : 589 – 600 .
   Web of Science ®Google Scholar
• Wang , C. , Xu , L. and Peng , W. 2007 . Conceptual design of remote monitoring and fault diagnosis systems . Information Systems , 32 : 996 – 1004 .
   Web of Science ®Google Scholar
• Wang , L. , Zeng , J. and Xu , L. 2011 . A decision support system for substage-zoning filling design of rock-fill dams based on particle swarm optimization . Information Technology and Management , 12 ( 2 ) : 111 – 119 .
   Web of Science ®Google Scholar
• Winter , P. and Smith , J. M. 1991 . Steiner minimal trees for three points with one convex polygonal obstacle . Annals of Operations Research , 33 : 577 – 599 .
   Google Scholar
• Wu , L. and Wang , X. 2008 . Particle swarm algorithms for Euclidean Steiner minimum tree (in Chinese) . In: Proceedings of 19th Chinese Conference on Computer technology and application, 15–17 July, 2008, Hefei, China , : 912 – 917 .
   Google Scholar
• Yang , B. 2006 . A hybrid evolutionary algorithm for the Euclidean Steiner tree problem using local searches . Lecture Notes in Computer Science , : 4251, 60 – 67 .
   Google Scholar