Fabien Geyer, A. Elefsiniotis, D. Schupke, S. Schneele
{"title":"飞机网络重量、性能和生存能力的多目标优化","authors":"Fabien Geyer, A. Elefsiniotis, D. Schupke, S. Schneele","doi":"10.1109/RNDM.2015.7325251","DOIUrl":null,"url":null,"abstract":"With a current utilization of around 25% of its total weight, optimization of cabling and harness plays an important role in the design of an aircraft. This is a multi-objective optimization problem as the physical properties of the harness (e.g., length and weight) as well as the logical properties of the underlying network (survivability and performance) have to be taken into account. We propose in this paper to investigate this multi-objective optimization problem and provide different algorithms to solve it. We first focus on expressing it as a mixed integer binary linear program. Due to the complexity of solving this class of linear programs, we propose various heuristics for providing a good solution to this problem.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-objective optimization of aircraft networks for weight, performance and survivability\",\"authors\":\"Fabien Geyer, A. Elefsiniotis, D. Schupke, S. Schneele\",\"doi\":\"10.1109/RNDM.2015.7325251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With a current utilization of around 25% of its total weight, optimization of cabling and harness plays an important role in the design of an aircraft. This is a multi-objective optimization problem as the physical properties of the harness (e.g., length and weight) as well as the logical properties of the underlying network (survivability and performance) have to be taken into account. We propose in this paper to investigate this multi-objective optimization problem and provide different algorithms to solve it. We first focus on expressing it as a mixed integer binary linear program. Due to the complexity of solving this class of linear programs, we propose various heuristics for providing a good solution to this problem.\",\"PeriodicalId\":248916,\"journal\":{\"name\":\"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RNDM.2015.7325251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2015.7325251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-objective optimization of aircraft networks for weight, performance and survivability
With a current utilization of around 25% of its total weight, optimization of cabling and harness plays an important role in the design of an aircraft. This is a multi-objective optimization problem as the physical properties of the harness (e.g., length and weight) as well as the logical properties of the underlying network (survivability and performance) have to be taken into account. We propose in this paper to investigate this multi-objective optimization problem and provide different algorithms to solve it. We first focus on expressing it as a mixed integer binary linear program. Due to the complexity of solving this class of linear programs, we propose various heuristics for providing a good solution to this problem.