{"title":"航空货运同时重量和容量规划与收益管理方法","authors":"Mohammad Vardi, A. Ghorbanian","doi":"10.1504/IJAMS.2018.10015874","DOIUrl":null,"url":null,"abstract":"Revenue management (RM) is a subfield of operations research with the aim to maximise the revenues acquired by selling perishable products/services. Due to the substantial growth in air cargo industry over the past few years, sophisticated techniques are needed to maximise revenue. In this paper, airline cargo capacity allocation problem in two cases, including cancellation possibility and impossibility have been investigated. Two capacity dimensions of the problem, volume and weight, is complicated the decision making about request acceptance policy. For the formulation of two problems, dynamic programming technique has been used. Since dynamic programming suffers from much memory consumption for large size problems, three heuristics including deterministic integer linear programming (DILP), bid price (BP) and dynamic programming decomposition (DPD) has been proposed for problems solving. Results of simulation showed that BP and DILP have the better performance comparing to other approaches. In addition, comparison of two problem's optimum values indicated that considering cancellation increase total revenue more than 10%.","PeriodicalId":38716,"journal":{"name":"International Journal of Applied Management Science","volume":"10 1","pages":"319-337"},"PeriodicalIF":0.3000,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Air cargo simultaneous weight and volume capacity planning with revenue management approach\",\"authors\":\"Mohammad Vardi, A. Ghorbanian\",\"doi\":\"10.1504/IJAMS.2018.10015874\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Revenue management (RM) is a subfield of operations research with the aim to maximise the revenues acquired by selling perishable products/services. Due to the substantial growth in air cargo industry over the past few years, sophisticated techniques are needed to maximise revenue. In this paper, airline cargo capacity allocation problem in two cases, including cancellation possibility and impossibility have been investigated. Two capacity dimensions of the problem, volume and weight, is complicated the decision making about request acceptance policy. For the formulation of two problems, dynamic programming technique has been used. Since dynamic programming suffers from much memory consumption for large size problems, three heuristics including deterministic integer linear programming (DILP), bid price (BP) and dynamic programming decomposition (DPD) has been proposed for problems solving. Results of simulation showed that BP and DILP have the better performance comparing to other approaches. In addition, comparison of two problem's optimum values indicated that considering cancellation increase total revenue more than 10%.\",\"PeriodicalId\":38716,\"journal\":{\"name\":\"International Journal of Applied Management Science\",\"volume\":\"10 1\",\"pages\":\"319-337\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2018-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Applied Management Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAMS.2018.10015874\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Management Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAMS.2018.10015874","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MANAGEMENT","Score":null,"Total":0}
Air cargo simultaneous weight and volume capacity planning with revenue management approach
Revenue management (RM) is a subfield of operations research with the aim to maximise the revenues acquired by selling perishable products/services. Due to the substantial growth in air cargo industry over the past few years, sophisticated techniques are needed to maximise revenue. In this paper, airline cargo capacity allocation problem in two cases, including cancellation possibility and impossibility have been investigated. Two capacity dimensions of the problem, volume and weight, is complicated the decision making about request acceptance policy. For the formulation of two problems, dynamic programming technique has been used. Since dynamic programming suffers from much memory consumption for large size problems, three heuristics including deterministic integer linear programming (DILP), bid price (BP) and dynamic programming decomposition (DPD) has been proposed for problems solving. Results of simulation showed that BP and DILP have the better performance comparing to other approaches. In addition, comparison of two problem's optimum values indicated that considering cancellation increase total revenue more than 10%.