一种电缆组件复杂度的数学建模及评估方法
|
摘要
针对电缆组件复杂程度描述方法的空缺、难以快速识别出电缆网中复杂电缆组件的问题,提出了电缆组件绝对复杂度和相对复杂度的概念,采用邻接矩阵存储方法对电缆组件的数据进行记录,引入Floyd算法对电缆组件相对复杂度进行了计算,建立了电缆组件复杂度的评估方法。应用提出的电缆组件复杂度的数学建模及评估方法,对某航天器整器电缆网设计进行了复杂度的识别和评估,以降低电缆组件复杂度为目标对电缆组件进行了优化。结果表明,该方法可以给出衡量电缆组件复杂程度的定量指标,快速识别出电缆网中的复杂电缆组件,可为电缆组件的优化设计提供参考。
Due to the vacancy of cable component complexity description method and the difficulty in quickly identifying the complex cable components in cable network,the concept of absolute complexity and relative complexity of cable components is proposed.Data of cable components is recorded using adjacency matrix storage method.The Floyd algorithm is introduced to calculate the complexity of the cable component.A method for evaluating the complexity can be used for the design of cable component product.Applying the mathematical modeling and evaluation method of the cable component complexity proposed,the complexity identification and evaluation of the cable network design of a certain spacecraft is carried out,and the cable component is optimized to reduce the complexity.The results show that the method can give quantitative indicators for measuring the complexity of cable component.It can effectively control the complexity of cable components in cable network,and provides a reference for the optimal design of future cable component products.
Due to the vacancy of cable component complexity description method and the difficulty in quickly identifying the complex cable components in cable network,the concept of absolute complexity and relative complexity of cable components is proposed.Data of cable components is recorded using adjacency matrix storage method.The Floyd algorithm is introduced to calculate the complexity of the cable component.A method for evaluating the complexity can be used for the design of cable component product.Applying the mathematical modeling and evaluation method of the cable component complexity proposed,the complexity identification and evaluation of the cable network design of a certain spacecraft is carried out,and the cable component is optimized to reduce the complexity.The results show that the method can give quantitative indicators for measuring the complexity of cable component.It can effectively control the complexity of cable components in cable network,and provides a reference for the optimal design of future cable component products.
引文
[1]康焱,刘刚,张柏楠,等.航天器电缆网快速协同设计方法及关键技术[J].航空学报,2018,39(7):322112Kang Yan,Liu Gang,Zhang Bainan,et al.Rapid codesign method and key technologies of spacecraft cable net[J].Acta Aeronautica et Astronautica Sinica,2018,39(7):322112(in Chinese)
[2]赵帅,卢晶.基于CATIA和CHS的商用车线束设计[J].汽车电器,2017,12:37-39Zhao Shuai,Lu Jing.Commercial car harness design based on CATIA and CHS[J].Automotive Electronics,2017,12:37-39(in Chinese)
[3]王志斌,刘检华,刘佳顺,等.面向电缆虚拟装配仿真的多分支弹簧质点模型[J].机械工程学报,2014,50(3):174-183Wang Zhibin,Liu Jianhua,Liu Jiashun,et al.A multi-branch mass-spring model for virtual assembly of cable harness[J].Journal of Mechanical Engineering,2014,50(3):174-183(in Chinese)
[4]匡梦良.多分支线缆几何与物理建模的研究[D].南京:东南大学,2016Kuang Mengliang.Research on multi-branch cable geometry and physical property modeling[D].Nanjing:Southeast University,2016(in Chinese)
[5]王桂平,王衍,任嘉辰.图论算法理论、实现及应用[M].北京:北京大学出版社,2011Wang Guiping,Wang Yan,Ren Jiachen.Graph theory algorithm theory,implementation and application[M].Beijing:Peking University Press,2011(in Chinese)
[6]梁娟.网络最短路径问题的研究与应用[D].南京:南京邮电大学,2015Liang Juan.Research and application of network shortest path problem[D].Nanjing:Nanjing University of Posts and Telecommunications,2015(in Chinese)
[7]田艳.复杂网络重要结点发现算法研究[D].昆明:云南财经大学,2015Tian Yan.Research on discovery algorithms for important node of complex network[D].Kunming:Yunnan University of Finance and Economics,2015(in Chinese)
[8]周忠玉,方欢,方贤文.图论最短路径算法的图形化演示及系统设计[J].电脑知识与技术,2016,12(18):159-160Zhou Zhongyu,Fang Huan,Fang Xianwen.Graphical demonstration and system design of graph theory shortest path algorithm[J].Computer Knowledge and Technology,2016,12(18):159-160(in Chinese)
[9]马莹,陈志龙,刘贺,等.基于Floyd改进加速算法的最短路径选择[J].信息技术与网络安全,2018,37(6):72-75,107Ma Ying,Chen Zhilong,Liu He,et al.Study on the shortest path selection based on Floyd improved acceleration algorithm[J].Information Technology and Network Security,2018,37(6):72-75,107(in Chinese)
[10]Ulrik Brandes.A faster algorithm for betweenness centrality[J].Journal of Mathematical Sociology,2001:25(2):163-177
[11]王美靖,李怡麒,李鑫,等.基于CHS与ProE_cabling电气系统线缆线束数字化设计[J].车辆与动力技术,2013,3:43-45Wang Meijing,Li Yiqi,Li xin,et al.Digital design of cabling for vehicle electrical system by CHS and Pro/E_cabling[J].Vehicle&Power Technology,2013,3:43-45(in Chinese)
[12]James C Goodding,J Cody Griffee,Emil V Ardelean.Parameter estimation and structural dynamic modeling of electrical cable harnesses on precision structures[J].American Institute of Aeronautics and Astronautics,2008-1852
[13]Zaoxu Zhu,M J L van Tooren,S W G Van der Elst.On the development of a heuristic routing application for the automatic wire harness design in the aircraft[J].American Institute of Aeronautics and Astronautics,2011-2148
[2]赵帅,卢晶.基于CATIA和CHS的商用车线束设计[J].汽车电器,2017,12:37-39Zhao Shuai,Lu Jing.Commercial car harness design based on CATIA and CHS[J].Automotive Electronics,2017,12:37-39(in Chinese)
[3]王志斌,刘检华,刘佳顺,等.面向电缆虚拟装配仿真的多分支弹簧质点模型[J].机械工程学报,2014,50(3):174-183Wang Zhibin,Liu Jianhua,Liu Jiashun,et al.A multi-branch mass-spring model for virtual assembly of cable harness[J].Journal of Mechanical Engineering,2014,50(3):174-183(in Chinese)
[4]匡梦良.多分支线缆几何与物理建模的研究[D].南京:东南大学,2016Kuang Mengliang.Research on multi-branch cable geometry and physical property modeling[D].Nanjing:Southeast University,2016(in Chinese)
[5]王桂平,王衍,任嘉辰.图论算法理论、实现及应用[M].北京:北京大学出版社,2011Wang Guiping,Wang Yan,Ren Jiachen.Graph theory algorithm theory,implementation and application[M].Beijing:Peking University Press,2011(in Chinese)
[6]梁娟.网络最短路径问题的研究与应用[D].南京:南京邮电大学,2015Liang Juan.Research and application of network shortest path problem[D].Nanjing:Nanjing University of Posts and Telecommunications,2015(in Chinese)
[7]田艳.复杂网络重要结点发现算法研究[D].昆明:云南财经大学,2015Tian Yan.Research on discovery algorithms for important node of complex network[D].Kunming:Yunnan University of Finance and Economics,2015(in Chinese)
[8]周忠玉,方欢,方贤文.图论最短路径算法的图形化演示及系统设计[J].电脑知识与技术,2016,12(18):159-160Zhou Zhongyu,Fang Huan,Fang Xianwen.Graphical demonstration and system design of graph theory shortest path algorithm[J].Computer Knowledge and Technology,2016,12(18):159-160(in Chinese)
[9]马莹,陈志龙,刘贺,等.基于Floyd改进加速算法的最短路径选择[J].信息技术与网络安全,2018,37(6):72-75,107Ma Ying,Chen Zhilong,Liu He,et al.Study on the shortest path selection based on Floyd improved acceleration algorithm[J].Information Technology and Network Security,2018,37(6):72-75,107(in Chinese)
[10]Ulrik Brandes.A faster algorithm for betweenness centrality[J].Journal of Mathematical Sociology,2001:25(2):163-177
[11]王美靖,李怡麒,李鑫,等.基于CHS与ProE_cabling电气系统线缆线束数字化设计[J].车辆与动力技术,2013,3:43-45Wang Meijing,Li Yiqi,Li xin,et al.Digital design of cabling for vehicle electrical system by CHS and Pro/E_cabling[J].Vehicle&Power Technology,2013,3:43-45(in Chinese)
[12]James C Goodding,J Cody Griffee,Emil V Ardelean.Parameter estimation and structural dynamic modeling of electrical cable harnesses on precision structures[J].American Institute of Aeronautics and Astronautics,2008-1852
[13]Zaoxu Zhu,M J L van Tooren,S W G Van der Elst.On the development of a heuristic routing application for the automatic wire harness design in the aircraft[J].American Institute of Aeronautics and Astronautics,2011-2148