Omar Ezzinbi, Malek Sarhani, A. E. Afia, Y. Benadada
{"title":"一种求解飞机在地时航线维修路线问题的元启发式方法","authors":"Omar Ezzinbi, Malek Sarhani, A. E. Afia, Y. Benadada","doi":"10.1109/GOL.2014.6887446","DOIUrl":null,"url":null,"abstract":"In the airline industry, the Aircraft Maintenance Routing (AMR) problem has been one of the great successes of operations research. The AMR problem is to determine a particular route for each aircraft to undergo different levels of maintenance checks. The objective is to minimize the total maintenance costs. In this study, our aim is to present a mathematical formulation for the AMR problem which takes into account the case of Aircraft On Ground (AOG). We develop solution approaches based on Particle Swarm Optimization algorithm and Genetic algorithm for solving the problem. The results show the effectiveness of this solution in reducing computational time.","PeriodicalId":265851,"journal":{"name":"2014 International Conference on Logistics Operations Management","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A metaheuristic approach for solving the airline maintenance routing with aircraft on ground problem\",\"authors\":\"Omar Ezzinbi, Malek Sarhani, A. E. Afia, Y. Benadada\",\"doi\":\"10.1109/GOL.2014.6887446\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the airline industry, the Aircraft Maintenance Routing (AMR) problem has been one of the great successes of operations research. The AMR problem is to determine a particular route for each aircraft to undergo different levels of maintenance checks. The objective is to minimize the total maintenance costs. In this study, our aim is to present a mathematical formulation for the AMR problem which takes into account the case of Aircraft On Ground (AOG). We develop solution approaches based on Particle Swarm Optimization algorithm and Genetic algorithm for solving the problem. The results show the effectiveness of this solution in reducing computational time.\",\"PeriodicalId\":265851,\"journal\":{\"name\":\"2014 International Conference on Logistics Operations Management\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Logistics Operations Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GOL.2014.6887446\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Logistics Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GOL.2014.6887446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A metaheuristic approach for solving the airline maintenance routing with aircraft on ground problem
In the airline industry, the Aircraft Maintenance Routing (AMR) problem has been one of the great successes of operations research. The AMR problem is to determine a particular route for each aircraft to undergo different levels of maintenance checks. The objective is to minimize the total maintenance costs. In this study, our aim is to present a mathematical formulation for the AMR problem which takes into account the case of Aircraft On Ground (AOG). We develop solution approaches based on Particle Swarm Optimization algorithm and Genetic algorithm for solving the problem. The results show the effectiveness of this solution in reducing computational time.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
