Literature Survey on Automatic Pipe Routing

Asmara A (2013) Pipe routing framework for detailed ship design. PhD thesis, Delft University of Technology. https://repository.tudelft.nl/islandora/object/uuid%3A4da99646-37d7-49e5-9d3b-51de81ba29dd

Park JH, Storch RL (2002) Pipe-routing algorithm development: case study of a ship engine room design. Expert Syst Appl 23(3):299–309. https://doi.org/10.1016/S0957-4174(02)00049-0

Calixto E, Bordeira P, Calazans H et al (2009) Plant design project automation using an automatic pipe routing routine. Comput Aided Chem Eng 27:807–812. https://doi.org/10.1016/S1570-7946(09)70355-4

Moran S (ed) (2017) Process plant layout, 2nd edn. Butterworth-Heinemann, Oxford, https://doi.org/10.1016/B978-0-12-803355-5.00040-8

Liu Q, Wang C (2008) A modified particle swarm optimizer for pipe route design. In: 2008 11th IEEE International Conference on Computational Science and Engineering - Workshops, pp 157–161. https://doi.org/10.1109/CSEW.2008.29

Belov G, Czauderna T, Dzaferovic A et al (2017) An optimization model for 3D pipe routing with flexibility constraints. In: Beck JC (ed) Principles and Practice of Constraint Programming. Springer International Publishing, Cham, pp 321–337. https://doi.org/10.1007/978-3-319-66158-2_21

Qian X, Ren T, Wang C (2008) A survey of pipe routing design. In: 2008 Chinese Control and Decision Conference. pp 3994–3998. https://doi.org/10.1109/CCDC.2008.4598081

Dong Z, Bian X (2020) Ship pipe route design using improved A* al-gorithm and genetic algorithm. IEEE Access 8:153273–15329. https://doi.org/10.1109/ACCESS.2020.3018145

Kimura H (2011). Automatic designing system for piping and instruments arrangement including branches of pipes. International Conference on Computer Applications in Shipbuilding 2011. https://doi.org/10.2534/JJASNAOE.14.165

Liu Q, Wang C (2011) A discrete particle swarm optimization algorithm for rectilinear branch pipe routing. Assem Autom 31:363–368. https://doi.org/10.1108/01445151111172952

Qu YF, Jiang D, Zhang XL (2018b) A new pipe routing approach for aero-engines by octree modeling and modified max-min ant system optimization algorithm. J Mech 34:1–9. https://doi.org/10.1017/jmech.2016.86

Yin Y, Zhou C, Zhu J (2010) A pipe route design methodology by imitating human imaginal thinking. CIRP Ann Manuf Technol 59:167–170. https://doi.org/10.1016/j.cirp.2010.03.096

Zhao H, Liu Q, Tong B (2019) Multi-pipe routing in bundles for aero-engine using MOPSO. DEStech Trans Comput Sci Eng 927–933. In: 2019 International Conference on Computation and Information Sciences (ICCIS 2019). https://doi.org/10.12783/dtcse/iccis2019/31995

Ito T, Fukuda S (1998) Hybrid approach to piping route path design using GA-based inspiration and rule-based inference. Concurr Eng 6(4):323–332. https://doi.org/10.1177/1063293X9800600405

Kumar S, Cheng J (2015) A BIM-based automated site layout planning framework for congested construction sites. Autom Constr 59:24–37. https://doi.org/10.1016/j.autcon.2015.07.008

Wu L, Tian X, Wang H et al (2019) Improved ant colony optimization algorithm and its application to solve pipe routing design. Assem Autom 39:45–57. https://doi.org/10.1108/AA-02-2018-022

Cazzaro D, Fischetti M, Fischetti M (2020) Heuristic algorithms for the Wind Farm Cable Routing problem. Appl Energy 278(115):617. https://doi.org/10.1016/j.apenergy.2020.115617

Conru A (1994) A genetic approach to the cable harness routing problem, vol 1. In: Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence. pp 200–205. https://doi.org/10.1109/ICEC.1994.350016

Duvnjak Zarkovic S, Shayesteh E, Hilber P (2021) Onshore wind farm - reliability centered cable routing. Electr Power Syst Res 196(107):201. https://doi.org/10.1016/j.epsr.2021.107201

Ma X, Iida K, Xie M et al (2006) A genetic algorithm for the optimization of cable routing. Syst Comput Japan 37:61–71. https://doi.org/10.1002/scj.10250

Afshar MH (2006) Application of a max-min ant system to joint layout and size optimization of pipe networks. Eng Optim 38(3):299–317. https://doi.org/10.1080/03052150500476357

Ivić S, Grbčić L, Družeta S (2016) Cooperative random walk for pipe network layout optimization. Int J Appl Eng Res 11:2839–2847. https://www.semanticscholar.org/paper/Cooperative-Random-Walk-for-Pipe-Network-Layout-Ivi%C4%87-Grb%C4%8Di%C4%87/a609f15a240ab8eed2593b647cf87406575ea3a8

Savic DA, Walters GA (1995) Genetic operators and constraint handling for pipe network optimization. In: Fogarty TC (ed) Evolutionary Computing. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 154–165. https://doi.org/10.1007/3-540-60469-3_32

Shiono N, Suzuki H, Saruwatari Y (2019) A dynamic programming approach for the pipe network layout problem. Eur J Oper Res 277(1):52–61. https://doi.org/10.1016/j.ejor.2019.02.036

Wang C, Sun X, Yuan T (2015) A method based genetic algorithm for pipe routing design. In: Proceedings of the 2015 International Conference on Advanced Engineering Materials and Technology. https://doi.org/10.2991/icaemt-15.2015.156

Wang C, Sun L, Sun X et al (2016) A method based on PSO for pipe routing design. In: 2016 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER), pp 422–427. https://doi.org/10.1109/CYBER.2016.7574862

Stanczak M, Pralet C, Vidal V et al (2021). A pipe routing hybrid approach based on a-star search and linear programming. Lect Notes Comp Sci 12735:179–195. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2021). https://doi.org/10.1007/978-3-030-78230-6_12

Feng H, Fu Y, Li R (2007) Pipe-routing algorithm for pipelines with branches. Appl Mech Mater 10–12:430–434. https://doi.org/10.4028/0-87849-470-7.430

Sandurkar S, Chen W (2000) GAPRUS - Genetic algorithms based pipe routing using tessellated objects. Comput Ind 38:209–223. https://doi.org/10.1016/S0166-3615(98)00130-4

Wang H, Zhao C, Yan W et al (2006) Three-dimensional multi-pipe route optimization based on genetic algorithms. International Federation for Information Processing Digital Library; Knowledge Enterprise: Intelligent Strategies in Product Design, Manufacturing, and Management 207:177–183. https://doi.org/10.1007/0-387-34403-9_23

Kim SH, Ruy WS, Jang BS (2013) The development of a practical pipe auto-routing system in a shipbuilding CAD environment using network optimization. Int J Nav Archit Ocean Eng 5(3):468–477. https://doi.org/10.2478/IJNAOE-2013-0146

Zhu D (1992) Exploring the interaction of geometry and search in path planning. PhD thesis, Stanford University, California

Zhu D, Latombe J (1991) Pipe routing-path planning (with many constraints). In: Proceedings. 1991 IEEE International Conference on Robotics and Automation. IEEE Computer Society, Los Alamitos, CA, USA, pp 1940–1947. https://doi.org/10.1109/ROBOT.1991.131911

Roh MI, Lee KY, Choi WY (2007) Rapid generation of the piping model having the relationship with a hull structure in shipbuilding. Adv Eng Softw 38:215–228. https://doi.org/10.1016/j.advengsoft.2006.10.002

Bellot F, Krause E (1988) Taxicab geometry: an adventure in non-euclidean geometry. Math Gaz 72:255. https://doi.org/10.2307/3618288

Szykman S, Cagan J (1996) Synthesis of optimal nonorthogonal routes. J Mech Des 118(3):419–424. https://doi.org/10.1115/1.2826902

Yuan H, Yu J, Jia D et al (2021) Group-based multiple pipe routing method for aero-engine focusing on parallel layout. Front Mech Eng 16:798–813. https://doi.org/10.1007/s11465-021-0645-3

Dielissen VJ, Kaldewaij A (1991) Rectangular partition is polynomial in two dimensions but NP-complete in three. Inf Process Lett 38:1–6. https://doi.org/10.1016/0020-0190(91)90207-X

Dong ZR, Lin Y (2017) A particle swarm optimization based approach for ship pipe route design. Int Shipbuild Prog 63:59–84. https://doi.org/10.3233/ISP-160123

Wang C, Liu Q (2011) Projection and geodesic-based pipe routing algorithm. IEEE Trans Autom Sci Eng 8:641–645. https://doi.org/10.1109/TASE.2010.2099219

Qu Y, Jiang D, Gao G et al (2015) Pipe routing approach for aircraft engines based on ant colony optimization. J Aerosp Eng 29(04015):057. https://doi.org/10.1061/(ASCE)AS.1943-5525.0000543

Ren T, Zhu ZL, Dimirovski G et al (2013) A new pipe routing method for aero-engines based on genetic algorithm. Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 228:424–434. https://doi.org/10.1177/0954410012474134

Ito T (1999) A genetic algorithm approach to piping route path planning. J Intell Manuf 10(1):103–114. https://doi.org/10.1023/A%3A1008924832167

Dong Z, Lin Y (2017) Ship Pipe routing method based on genetic algorithm and cooperative coevolution. J Sh Prod Des 33:122–134. https://doi.org/10.5957/JSPD.33.2.150005

Asmara A (2006) Automatic piping system in ship. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.105.354&rep=rep1&type=pdf. Paper presented at the International Conference on Computer and IT Application (COMPIT)

Wang Y, Yu Y, Li K et al (2018) A human-computer cooperation improved ant colony optimization for ship pipe route design. Ocean Eng 150:12–20. https://doi.org/10.1016/j.oceaneng.2017.12.024

Van der Tak C (1976) The optimum routeing of pipes in a ship’s engine room. Paper presented at the Computer Applications in the Automation of Shipyard Operation and Ship Design II, ICCAS ‘76. https://repository.tudelft.nl/islandora/object/uuid%3A2e1ed503-51d3-4b1b-acaf-b00558abfe4e

Mehta D, Blust G (1997) Corner stitching for simple rectilinear shapes [VLSI layouts]. IEEE Trans Comput Aided Des Integr Circuits Syst 16(2):186–198. https://doi.org/10.1109/43.573833

Ousterhout J (1984) Corner stitching: a data-structuring technique for VLSI layout tools. IEEE Trans Comput Aided Des Integr Circuits Syst 3(1):87–100. https://doi.org/10.1109/TCAD.1984.1270061

Ivorra B (2018) Application of the Laminar Navier-Stokes equations for solving 2D and 3D pathfinding problems with static and dynamic spatial constraints: implementation and validation in Comsol Multiphysics. J Sci Comput 74:1163–1187. https://doi.org/10.1007/s10915-017-0489-5

Lingas A, Pinter R, Rivest R et al (1982) Minimum edge length partitioning of rectilinear polygons. Proceedings - Annual Allerton Conference on Communication, Control, and Computing, pp 53–63. https://www.scopus.com/record/display.uri?eid=2-s2.0-0020227929 &origin=inward &txGid=d67439ff1a4f65c08b10b58e12ad0c14

Yamada Y, Teraoka Y (1998) An optimal design of piping route in a CAD system for power plant. Comput Math with Appl 35(6):137–149. https://doi.org/10.1016/S0898-1221(98)00025-X

Qu Y, Jiang D, Yang Q (2018a) Branch pipe routing based on 3D connection graph and concurrent ant colony optimization algorithm. J Intell Manuf 29:1647–1657. https://doi.org/10.1007/s10845-016-1203-4

Liu Q, Wang C (2012) Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation. Enterp Inf Syst 6(3):315–327. https://doi.org/10.1080/17517575.2011.594910

Liu Q, Wang C (2013) A graph-based pipe routing algorithm in aero-engine rotational space. J Intell Manuf 26. https://doi.org/10.1007/s10845-013-0840-0

de Berg M, van Kreveld M, Overmars M et al (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77974-2

Wormser C (2008) Generalized Voronoi diagrams and applications. PhD thesis, Université Nice Sophia Antipoli. https://hal.science/tel-00410850/

Liu Q (2015) A rectilinear pipe routing algorithm: Manhattan visibility graph. Int J Comput Integr Manuf 29:1–10. https://doi.org/10.1080/0951192X.2015.1033019

Thantulage G, Kalganova T, Fernando W (2006) A grid-based ant colony algorithm for automatic 3D hose routing. In: 2006 IEEE International Conference on Evolutionary Computation. pp 48–55. https://doi.org/10.1109/CEC.2006.1688289

Abd Algfoor Z, Sunar M, Kolivand H (2015) A comprehensive study on pathfinding techniques for robotics and video games. Int J Comput Games Technol 2015:1–11. https://doi.org/10.1155/2015/736138

Shin DS, Park BC, Lim CO et al (2020) Pipe routing using reinforcement learning on initial design stage. Journal of the Society of Naval Architects of Korea 57:191–197. https://doi.org/10.3744/SNAK.2020.57.4.191

Stanczak M, Pralet C, Vidal V et al (2020) Optimal pipe routing techniques in an obstacle-free 3D space. In: Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - ICORES. pp 69–79. https://doi.org/10.5220/0008923300690079

Yin Y, Xu L, Bi Z et al (2013) A novel human-machine collaborative interface for aero-engine pipe routing. IEEE Trans Ind Inf 9:2187–2199. https://doi.org/10.1109/TII.2013.2257805

Jiang WY, Lin Y, Chen M et al (2014) An ant colony optimization-genetic algorithm approach for ship pipe route design. Int Shipbuild Prog 61:163–183. https://doi.org/10.3233/ISP-140111

Fernando T (2009) Ant colony optimization based simulation of 3D automatic hose/pipe routing. PhD Thesis, Brunel University School of Engineering and Design. http://bura.brunel.ac.uk/handle/2438/4282

Liu L, Liu Q (2018) Multi-objective routing of multi-terminal rectilinear pipe in 3D space by MOEA/D and RSMT. In: 2018 3rd International Conference on Advanced Robotics and Mechatronics (ICARM), pp 462–467. https://doi.org/10.1109/ICARM.2018.8610824

Ikehira S, Kimura H, Ikezaki E et al (2005) Automatic design for pipe arrangement using multi-objective genetic algorithms. J Jpn Soc Nav Archit Ocean Eng 2:155–160. https://doi.org/10.2534/jjasnaoe.2.155

Asmara A, Nienhuis U, Hekkenberg R (2010) Approximate orthogonal simplification of 3D model. In: IEEE Congress on Evolutionary Computation. pp 1–4. https://doi.org/10.1109/CEC.2010.5586162

Niu W, Sui H, Niu Y et al (2016) Ship pipe routing design using NSGA-II and coevolutionary algorithm. Math Probl Eng 2016:1–21. https://doi.org/10.1155/2016/7912863

Van der Velden C, Bil C, Yu X et al (2007) An intelligent system for automatic layout routing in aerospace design. ISSE 3:117–128. https://doi.org/10.1007/s11334-007-0021-4

Martins P, Lobo V (2009) A tool for automatic routing of auxiliary circuits in ships. Paper presented at 11th Seminário Luso-Espanhol de Economia Empresarial 2009. https://cir.nii.ac.jp/crid/1573387450606843904

Zhou Q, Lv Y (2020) Research based on Lee algorithm and genetic algorithm of the automatic external pipe routing of the aircraft engine. Int J Mech Eng Appl 8:40. https://doi.org/10.11648/j.ijmea.20200801.16

Ajiwaskita F, Gunawan G, Yanuar Y (2020) Pipe-routing optimization using system engineering methodology in ship engine room. p 020022. https://doi.org/10.1063/5.0001001

Huibiao L, Peiting S, Yutang Z (2010) Environment modelling for simulation-based pipeline design in engine room. pp 318–320. https://doi.org/10.1109/ICCMS.2010.65

Christodoulou S, Ellinas G (2010) Pipe routing through ant colony optimization. J Infrastruct Syst 16:149–159. https://doi.org/10.1061/(ASCE)1076-0342(2010)16:2(149)

Rodrigues GPW, Costa LHM, Farias GM et al (2019) A depth-first search algorithm for optimizing the gravity pipe networks layout. Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA) 33(13):4583–4598. https://doi.org/10.1007/s11269-019-02373-

Schmidt-Traub H, Holtkötter T, Lederhose M et al (1999) An approach to plant layout optimization. Chem Eng Technol 22:105–109. https://doi.org/10.1002/(SICI)1521-4125(199902)22:2<105::AID-CEAT105>3.0.CO;2-G

Singh J, Cheng JCP (2021) Automating the generation of 3D multiple pipe layout design using BIM and Heuristic search methods. In: Toledo Santos E, Scheer S (eds) Proceedings of the 18th International Conference on Computing in Civil and Building Engineering. Springer International Publishing, pp 54–72. https://doi.org/10.1007/978-3-030-51295-8_6

Wu Y, Wang R, Wang Y et al (2018) An area-wide layout design method considering piecewise steam piping and energy loss. Chem Eng Res Des 138:405–417. https://doi.org/10.1016/j.cherd.2018.09.007

Sui H, Niu W (2016) Branch-pipe-routing approach for ships using improved genetic algorithm. Front Mech Eng 11:316–323. https://doi.org/10.1007/s11465-016-0384-z

Sakti A, Zeidner L, Hadzic T et al (2016) Constraint programming approach for spatial packaging problem. In: Quimper CG (ed) Integration of AI and OR Techniques in Constraint Programming. Springer International Publishing, Cham, pp 319–328. https://doi.org/10.1007/978-3-319-33954-2_23

Jiang WY, Lin Y, Chen M et al (2015) A co-evolutionary improved multi-ant colony optimization for ship multiple and branch pipe route design. Ocean Eng 102:63–70. https://doi.org/10.1016/j.oceaneng.2015.04.028

Wu BC, Young GS, Schmidt W et al (2009) Applying fuzzy functions and sequential coordination to optimization of machinery arrangement and pipe routing. Nav Eng J 110:43–54. https://doi.org/10.1111/j.1559-3584.1998.tb02964.x

Ikehira S, Kimura H (2009) Automatic design algorithm for pipe arrangement considering valve operationality.  J Jpn Soc Nav Archit Ocean Eng 9:231–236. https://doi.org/10.2534/jjasnaoe.9.231

Bai X, Zhang Y (2012) Engineering rules-based orthogonal and variable-steps pipe routing algorithm for aero-engines. Adv Mater Res 442:104–108. https://doi.org/10.4028/www.scientific.net/AMR.442.104

Kang SS, Myung S, Han S (1999) A design expert system for auto-routing of ship pipes. J Ship Prod Des 15. https://doi.org/10.5957/jsp.1999.15.1.1

Arora S, Barak B (2009) Computational complexity - a modern approach, 1st edn. Cambridge University Press, Cambridge, United Kingdom. https://doi.org/10.1017/CBO9780511804090

Schelbert J (2015) Discrete approaches for optimal routing of high pressure pipes. Doctoral thesis, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU). https://nbn-resolving.org/urn:nbn:de:bvb:29-opus4-66837

Adcock A, Demaine E, Demaine M et al (2014) Zig-Zag Numberlink is NP-Complete. J Inf Process 23. https://doi.org/10.2197/ipsjjip.23.239

Lengauer T (1990) Combinatorial algorithms for integrated circuit layout. Applicable Theory in Computer Science. https://doi.org/10.1007/978-3-322-92106-2

Lynch J (1975) The equivalence of theorem proving and the interconnection problem. ACM SIGDA Newsletter 5:31–65. https://doi.org/10.1145/1061425.1061430

Richards (1984) Complexity of single-layer routing. IEEE Transactions on Computers C-33(3):286–288. https://doi.org/10.1109/TC.1984.1676428

Belov G, Cohen L, de la Banda MG et al (2019) Position paper: from multi-agent pathfinding to pipe routing. CoRR abs/1905.08412. https://doi.org/10.48550/arXiv.1905.08412

Fortz B, Gouveia L, Joyce-Moniz M (2017) Models for the piecewise linear unsplittable multicommodity flow problems. Eur J Oper Res 261:30–42. https://doi.org/10.1016/j.ejor.2017.01.051

Canny J, Reif J (1987) New lower bound techniques for robot motion planning problems. Proc IEEE Conf Foundations Computer Science 49–60. https://doi.org/10.1109/SFCS.1987.42

Lozano-Pérez T, Wesley M (1979) An algorithm for planning collision free paths among polyhedral obstacles. Commun ACM 22:560–570. https://doi.org/10.1145/359156.359164

Li F, Klette R (2011) Euclidean shortest paths - exact or approximate algorithms. Springer. https://doi.org/10.1007/978-1-4471-2256-2_1

Ljubić I (2021) Solving Steiner trees: Recent advances, challenges, and perspectives. Networks 77(2):177–204. https://doi.org/10.1002/net.22005

Prömel HJ, Steger A (2002) Geometric steiner problems. Vieweg+Teubner Verlag, Wiesbaden, pp 191–222. https://doi.org/10.1007/978-3-322-80291-0_10

Hu Y, Jing T, Hong X et al (2005) An-Oarsman: obstacle-avoiding routing tree construction with good length performance, vol 1. In: Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005. pp 7–12. https://doi.org/10.1109/ASPDAC.2005.1466120

Bhagwat A (2015) Obstacle-avoiding rectilinear steiner minimum tree: a survey. International Journal of Innovative Research in Computer and Communication Engineering 3:2810–2816. http://ijircce.com/admin/main/storage/app/pdf/rux2yJw5PkIsV9tab2hrkVJJLqywD1kQoUF6nJmm.pdf

Kundu S, Roy S, Mukherjee S (2020) Rectilinear Steiner Tree construction techniques using PB-SAT-based methodology. J Circuits Syst Comput 29(04):2050057. https://doi.org/10.1142/S0218126620500577

Kundu S, Roy S, Mukherjee S (2021) An efficient obstacle-avoiding rectilinear Steiner Tree construction method using PB-SAT. IETE J Res 1–11. https://doi.org/10.1080/03772063.2021.1967790

Ganley JL, Cohoon JP (1994) Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In: Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94, vol 1. pp 113–116. https://doi.org/10.1109/ISCAS.1994.408768

Nguyen H, Kim DJ, Gao J (2016) 3D piping route design including branch and elbow using improvements for Dijkstra’s Algorithm. Proceedings of the 2016 International Conference on Artificial Intelligence: Technologies and Applications https://doi.org/10.2991/icaita-16.2016.76

Bern M (2006) Faster exact algorithms for Steiner trees in planar networks. Networks 20:109–120. https://doi.org/10.1002/net.3230200110

Furuholmen M, Glette K, Høvin M et al (2010) Evolutionary approaches to the three-dimensional multi-pipe routing problem: a comparative study using direct encodings. Lect Notes Comput Sci 6022:71–82. In: European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2010). https://doi.org/10.1007/978-3-642-12139-5_7

Jansen R, Vinkesteijn Y, van den Berg D (2020) On the solvability of routing multiple point-to-point paths in Manhattan Meshes. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, New York, NY, USA, GECCO ’20, p 1685–1689. https://doi.org/10.1145/3377929.3398098

Schmidt-Traub H, Köster M, Holtkötter T et al (1998) Conceptual plant layout. Comput Chem Eng 22:S499–S504. https://doi.org/10.1016/S0098-1354(98)00093-3

Kim D, Corne D (1996) Industrial plant pipe-route optimisation with genetic algorithms. Lect Notes Comput Sci 1141:1012–1021. https://doi.org/10.1007/3-540-61723-X_1064

Kahng AB, Lienig J, Markov IL et al (2011) VLSI physical design: from graph partitioning to timing closure, 1st edn. Springer Publishing Company, Incorporated. https://doi.org/10.1007/978-90-481-9591-6

Dijkstra E (1959) A note on two problems in Connexion with graphs. Numer Math 1:269–271. https://doi.org/10.1007/BF01386390

Lee CY (1961) An algorithm for path connections and its applications. IRE Trans Electron Comput 10:346–365. https://doi.org/10.1109/TEC.1961.5219222

Ando Y, Kimura H (2011) An automatic piping algorithm including elbows and bends. In: RINA, Royal Institution of Naval Architects - International Conference on Computer Applications in Shipbuilding 2011, Papers. pp 153–158. https://doi.org/10.2534/JJASNAOE.15.219

Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Man Cybern 4(2):100–107. https://doi.org/10.1109/TSSC.1968.300136

Harabor D, Grastien A (2011) Online graph pruning for pathfinding on grid maps. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence. AAAI Press, p 1114–1119. https://dl.acm.org/doi/10.5555/2900423.2900600

Min JG, Ruy WS, Park CS (2020) Faster pipe auto-routing using improved jump point search. International Journal of Naval Architecture and Ocean Engineering 12:596–604. https://doi.org/10.1016/j.ijnaoe.2020.07.004

Dorigo M (1992) Optimization, learning and natural algorithms. PhD Thesis, Politecnico di Milano, Italy. https://cir.nii.ac.jp/crid/1573950400977139328

Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B, Cybernetics: a Publication of the IEEE Systems, Man, and Cybernetics Society 26:29–41. https://doi.org/10.1109/3477.484436

Fan X, Lin Y, Ji Z (2006) The ant colony optimization for ship pipe route design in 3D space. In: 2006 6th World Congress on Intelligent Control and Automation. pp 3103–3108. https://doi.org/10.1109/WCICA.2006.1712938

Stützle T, Hoos HH (2000) Max-min ant system. Futur Gener Comput Syst 16(8):889–914. https://doi.org/10.1016/S0167-739X(00)00043-1

Kennedy J, Eberhart R (1995) Particle swarm optimization, vol 4. In: Proceedings of ICNN’95 - International Conference on Neural Networks. pp 1942–1948. https://doi.org/10.1109/ICNN.1995.488968

Shi Y, Eberhart RC (1998) Parameter selection in particle swarm optimization. In: Porto VW, Saravanan N, Waagen D et al (eds) Evolutionary Programming VII. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 591–600. https://doi.org/10.1007/BFb0040810

Liu Q, Wang C (2010) Pipe-assembly approach for aero-engines by modified particle swarm optimization. Assem Autom 30:365–377. https://doi.org/10.1108/01445151011075825

Holland J (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology. Control, and Artificial Intelligence. https://doi.org/10.7551/mitpress/1090.001.0001

Ito T (2002) Route planning wizard: basic concept and its implementation. Paper presented at the International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2002. https://doi.org/10.1007/3-540-48035-8_53

Li H, Zhang Q (2006) A multiobjective differential evolution based on decomposition for multiobjective optimization with variable linkages. In: Parallel Problem Solving from Nature - PPSN IX. Springer Berlin Heidelberg, Berlin, Heidelberg. pp 583–592. https://doi.org/10.1007/11844297_59

Huibiao L, Zhefu Y, Peiting S (2009) Hanging bridge algorithm for pipe-routing design in ship engine room. Proceedings - International Conference on Computer Science and Software Engineering, CSSE 1:153–155. https://doi.org/10.1109/CSSE.2008.1216

Deliang L, Huibiao L (2009) Interfere-check applying to 3D automatic pipe route arrangement. Proceedings of International Conference on Computational Intelligence and Software Engineering, Wuhan. https://doi.org/10.1109/CISE.2009.5365920

Gunawan MDMalik, Asmara LK (2020) Module development of piping system design with rule based algorithms. In: American Institute of Physics Conference Series. p 020019. https://doi.org/10.1063/5.0001000

Bai X, Zhang Y (2012) Research on information extraction in pipe-routing layout space for complex products. Appl Mech Mater 155–156:250–254. https://doi.org/10.4028/www.scientific.net/AMM.155-156.250

Dong Z, Bian X, Yang S (2020) Space modeling method for ship pipe route design. In: Qin P, Wang H, Sun G et al (eds) Data Science. Springer Singapore, Singapore, pp 384–392. https://doi.org/10.1007/978-981-15-7984-4_28

Fan X, Lin Y, Ji Z (2010) The ES model for ship pipes routing design. In: 2010 8th World Congress on Intelligent Control and Automation. pp 2787–2792. https://doi.org/10.1109/WCICA.2010.5554929

Liu Q, Xu R, Liu X (2012) A CAD system development for pipe and cable planning. In: 2012 3rd International Conference on System Science, Engineering Design and Manufacturing Informatization. pp 131–133. https://doi.org/10.1109/ICSSEM.2012.6340826

Deb K (2001) Multiobjective optimization using evolutionary algorithms. John Wiley & Sons, Ltd, Baffins Lane, Chichester, United Kingdom