Pipe Routing Approach for Aircraft Engines Based on Ant Colony Optimization
Publication: Journal of Aerospace Engineering
Volume 29, Issue 3
Abstract
Aircraft engines usually contain a lot of pipes and cables whose routing design greatly affects engine performance and reliability. In this paper a pipe routing approach for aircraft engines based on ant colony optimization is proposed, which contains improvements in three aspects. First, constraints over aircraft engine pipe routing are formulated and classified with respect to nine aspects. Second, a fan annual mesh of the layout space is developed, and two-mesh division is conducted to store and update environmental information about the layout space. Every unit obtained by the layout space modeling has been assigned a potential value to meet constraints and represent different areas in the layout space. Third, an improved ant colony optimization is developed for pipe routing, which includes the classification of ant colony, rank mechanism updating rule of pheromone intensity, and a dynamic updating rule of heuristic information. Every ant can search for 26 adjacent units in random directions and across layers. Simulation results show that the proposed pipe routing approach is effective.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
The authors thank the editor and anonymous reviewers for their helpful comments and suggestions. The work was supported by the National Natural Science Foundation of China (Grant 51175341).
References
Bai, X. L., Zhang, Y., Xie, H. L., and Ren, T. (2009). “Spatial information extraction for automatic layout routing in complex product design.” Proc., Control and Decision Conf., IEEE, New York, 5463–5466.
Bullnheimer, B., Hartl, R. F., and Strauss, C. (1999). “A new rank based version of the ant system—A computational study.” Cent. Eur. J. Oper. Res., 7(1), 25–38.
Christodoulou, S. E., and Ellinas, G. (2010). “Pipe routing through ant colony optimization.” J. Infrastruct. Syst., 149–159.
Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. (2002). “A fast and elitist multiobjective genetic algorithm: NSGA-II.” IEEE Trans. Evol. Comput., 6(2), 182–197.
Dorigo, M., and Birattari, M. (2006). “Ant colony optimization.” IEEE Comput. Intell. Mag., 1(4), 28–39.
Dorigo, M., and Gambardella, L. M. (1997). “Ant colony system: A cooperative learning approach to the traveling salesman problem.” IEEE Trans. Evol. Comput., 1(1), 53–66.
Dorigo, M., Maniezzo, V., and Colorni, A. (1996). “Ant system: Optimization by a colony of cooperating agents.” IEEE Trans. Syst. Man. Cybern. B, 26(1), 29–41.
Fan, X. N., Lin, Y., and Ji, Z. S. (2006). “The ant colony optimization for ship pipe route design in 3D space.” Proc., 6th IEEE World Congress on Intelligent Control and Automation, IEEE, New York, 3103–3108.
Fan, X. N., Lin, Y., and Ji, Z. S. (2009). “Multi ant colony cooperative coevolution for optimization of ship multi pipe parallel routing.” J. Shanghai Jiaotong Univ., 43(2), 193–197 (in Chinese).
Guirardello, R., and Swaney, R. E. (2005). “Optimization of process plant layout with pipe routing.” Comput. Chem. Eng., (1), 99–114.
Hu, W., Hadler, K., Neethling, S. J., and Cilliers, J. J. (2013). “Determining flotation circuit layout using genetic algorithms with pulp and froth models.” Chem. Eng. Sci., 102(1), 32–41.
Hu, X. B. (2004). “Research on principles, theory and application of ant colony optimization.” Ph.D. dissertation, Chongqing Univ., Chongqing, China (in Chinese).
Ito, T. (1999). “A genetic algorithm approach to piping route path planning.” J. Intell. Manuf., 10(1), 103–114.
Ito, T. (2001). “Implementation and evaluation for GA-based pipe route planning method.” Proc., European Simulation Symp., SCS, Ghent, 462–466.
Kang, S. S., Sehyun, M., and Hah, S. (1999). “A design expert system for auto-routing of ship pipes.” J. Ship Prod., 15(1), 1–9.
Kim, S. H., Ruy, W. S., and Jang, B. S. (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.
Kiran, M. S., Gündüz, M., and Baykan, Ö. K. (2012). “A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum.” Appl. Math. Comput., 219(4), 1515–1521.
Lee, C. Y. (1961). “An algorithm for path connections and its applications.” IRE Trans. Electron. Comput., EC-10(3), 346–365.
Liu, Q., and Wang, C. (2010). “Pipe-assembly approach for aero-engines by modified particle swarm optimization.” Assembly Autom., 30(4), 365–377.
Liu, Q., and Wang, C. (2012). “Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation.” Enterp. Inf. Syst., 6(3), 315–327.
Liu, Q., and Wang, C. E. (2008). “A modified particle swarm optimizer for pipe route design.” Proc., 11th IEEE Int. Conf. on Computational Science and Engineering Workshops, IEEE, New York, 157–161.
Liu, Q., and Wang, C. E. (2011). “A discrete particle swarm optimization algorithm for rectilinear branch pipe routing.” Assembly Autom., 31(4), 363–368.
MATLAB 7.0 [Computer software]. MathWorks, Natick, MA.
Pan, G. Y., Qiao, J. F., and Han, H. G. (2013). “A new strategy of chaotic PSO and its application in optimization design for pipe network.” Proc., 32nd Chinese Control Conf., TCCT, Beijing, 8022–8027.
Poli, R., Kennedy, J., and Blackwell, T. (2007). “Particle swarm optimization.” Swarm Intell., 1(1), 33–57.
Ren, T., Zhu, Z. L., Dimirovski, G. M., Gao, Z. H., Sun, X. H., and Yu, H. (2013). “A new pipe routing method for aero-engines based on genetic algorithm.” J. Aerosp. Eng., 228(3), 424–434.
Shan, M. Y., Wu, J., and Peng, D. N. (2007). “Particle swarm and ant colony algorithms hybridized for multi-mode resource-constrained project scheduling problem with minimum time lag.” Proc., Int. Conf. on Wireless Communications, Networking and Mobile Computing, IEEE, New York, 5898–5902.
Stützle, T., and Hoos, H. H. (2000). “MAX-MIN ant system.” Future Gener. Comput. Syst., 16(8), 889–914.
Van der Velden, C., Bil, C., Yu, X. H., and Smith, A. (2007). “An intelligent system for automatic layout routing in aerospace design.” Innovations Syst. Software Eng., 3(2), 117–128.
Wang, C. E., and Liu, Q. (2011). “Projection and geodesic-based pipe routing algorithm.” IEEE Trans. Autom. Sci. Eng., 8(3), 641–645.
Yamada, Y., and Teraoka, Y. (1998). “An optimal design of piping route in a CAD system for power plant.” Comput. Math. Appl., 35(6), 137–149.
Yin, Y. H., Xu, L. D., Bi, Z., Chen, H., and Zhou, C. (2013). “Novel human-machine collaborative interface for aero-engine pipe routing.” IEEE Trans. Ind. Inf., 9(4), 2187–2199.
Yin, Y. H., Zhou, C., and Zhu, J. Y. (2010). “A pipe route design methodology by imitating human imaginal thinking.” CIRP Ann. Manuf. Technol., 59(1), 167–170.
Zhou, C., and Yin, Y. H. (2010). “Pipe assembly planning algorithm by imitating human imaginal thinking.” Assembly Autom., 30(1), 66–74.
Zhu, D., and Latombe, J. C. (1991). “Pipe routing-path planning (with many constraints).” Proc., IEEE Int. Conf. on Robotics and Automation, IEEE, New York, 1940–1947.
Information & Authors
Information
Published In
Journal of Aerospace Engineering
Volume 29 • Issue 3 • May 2016
Copyright
© 2015 American Society of Civil Engineers.
History
Received: Mar 11, 2014
Accepted: Jul 1, 2015
Published online: Sep 22, 2015
Discussion open until: Feb 22, 2016
Published in print: May 1, 2016
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.