Pub Date : 2023-01-10DOI: 10.1080/03155986.2022.2164438
Ruiyou Zhang, Zhiyou Li
Abstract Green tourism has become a hot issue in both academic fields and companies recently. A green tourism supply chain composed of a government, a green scenic area and a travel agency is addressed using the game theory. The scenic area in the supply chain sells tickets to tourists through the travel agency, and makes extra investment on environmental protection to improve its green degree. The government provides financial subsidy to the green scenic area maximizing both the total social welfare and environmental improvements. Two Stackelberg game models of the green tourism supply chain, without and with the governmental subsidy, are built and solved by the backward induction method. The theoretical analyses indicate that the governmental subsidy can increase the demand of green tourism, and enhance the total social welfare and environmental protection level of the whole supply chain.
{"title":"Stackelberg game model of green tourism supply chain with governmental subsidy","authors":"Ruiyou Zhang, Zhiyou Li","doi":"10.1080/03155986.2022.2164438","DOIUrl":"https://doi.org/10.1080/03155986.2022.2164438","url":null,"abstract":"Abstract Green tourism has become a hot issue in both academic fields and companies recently. A green tourism supply chain composed of a government, a green scenic area and a travel agency is addressed using the game theory. The scenic area in the supply chain sells tickets to tourists through the travel agency, and makes extra investment on environmental protection to improve its green degree. The government provides financial subsidy to the green scenic area maximizing both the total social welfare and environmental improvements. Two Stackelberg game models of the green tourism supply chain, without and with the governmental subsidy, are built and solved by the backward induction method. The theoretical analyses indicate that the governmental subsidy can increase the demand of green tourism, and enhance the total social welfare and environmental protection level of the whole supply chain.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"36 1","pages":"141 - 168"},"PeriodicalIF":1.3,"publicationDate":"2023-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74724458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-28DOI: 10.1080/03155986.2022.2150012
Yuqiu Xu, Q. Cao, Kaiying Cao, Jia Wang
Abstract With the rapid development of low-carbon tourism and online travel agencies (OTAs), whether to enter OTAs has been a problem faced by tour operators in the context of low-carbon tourism. Besides, if tour operators enter OTAs, whether to provide online refund policies is also a challenge for them. To research whether tour operators should enter OTAs and provide online refund policies, three models are built. Main results reveal that when OTAs charge relatively high annual service fees, tour operators should not enter OTAs. When the annual service fees are relatively low and tourist’s satisfaction rate with tour package from online channel meets the constraint in our models, tour operators will enter OTAs and always provide online refund policies for tourists. Although entering OTAs and providing online refund policies will benefit tour operators and tourists, they will cause the worst impact on the environment. Moreover, when considering the impacts of online reviews, government subsidy and discounted value of the dissatisfied low-carbon tour package, operation strategies of tour operators are still held. When considering the different power structure, tour operators’ optimal channel choice strategies are not changed but optimal online refund policy strategies have changed a lot.
{"title":"Optimal channel choices and online refund policies in a low-carbon tourism supply chain considering carbon reduction level","authors":"Yuqiu Xu, Q. Cao, Kaiying Cao, Jia Wang","doi":"10.1080/03155986.2022.2150012","DOIUrl":"https://doi.org/10.1080/03155986.2022.2150012","url":null,"abstract":"Abstract With the rapid development of low-carbon tourism and online travel agencies (OTAs), whether to enter OTAs has been a problem faced by tour operators in the context of low-carbon tourism. Besides, if tour operators enter OTAs, whether to provide online refund policies is also a challenge for them. To research whether tour operators should enter OTAs and provide online refund policies, three models are built. Main results reveal that when OTAs charge relatively high annual service fees, tour operators should not enter OTAs. When the annual service fees are relatively low and tourist’s satisfaction rate with tour package from online channel meets the constraint in our models, tour operators will enter OTAs and always provide online refund policies for tourists. Although entering OTAs and providing online refund policies will benefit tour operators and tourists, they will cause the worst impact on the environment. Moreover, when considering the impacts of online reviews, government subsidy and discounted value of the dissatisfied low-carbon tour package, operation strategies of tour operators are still held. When considering the different power structure, tour operators’ optimal channel choice strategies are not changed but optimal online refund policy strategies have changed a lot.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"111 1","pages":"34 - 66"},"PeriodicalIF":1.3,"publicationDate":"2022-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79626700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-24DOI: 10.1080/03155986.2022.2131292
Teodor Gabriel Crainic, Antonio Frangioni, Michel Gendreau
Published in INFOR: Information Systems and Operational Research (Vol. 60, No. 4, 2022)
发表于INFOR:信息系统与运筹学(第60卷第4期，2022年)
{"title":"Bernard Gendron (1966–2022): friend and colleague","authors":"Teodor Gabriel Crainic, Antonio Frangioni, Michel Gendreau","doi":"10.1080/03155986.2022.2131292","DOIUrl":"https://doi.org/10.1080/03155986.2022.2131292","url":null,"abstract":"Published in INFOR: Information Systems and Operational Research (Vol. 60, No. 4, 2022)","PeriodicalId":13645,"journal":{"name":"Infor","volume":"26 1","pages":""},"PeriodicalIF":1.3,"publicationDate":"2022-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138537531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-24DOI: 10.1080/03155986.2022.2131294
T. G. Crainic, Antonio Frangioni, M. Gendreau
{"title":"Bernard Gendron (1966–2022): Un ami et un collègue","authors":"T. G. Crainic, Antonio Frangioni, M. Gendreau","doi":"10.1080/03155986.2022.2131294","DOIUrl":"https://doi.org/10.1080/03155986.2022.2131294","url":null,"abstract":"","PeriodicalId":13645,"journal":{"name":"Infor","volume":"1 1","pages":"432 - 435"},"PeriodicalIF":1.3,"publicationDate":"2022-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91261709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-07DOI: 10.1080/03155986.2022.2129210
J. Cordeau, M. Iori, N. F. M. Mendes, Davide Nelli, Riccardo Tedeschi
Abstract We study a Dial-a-Flight Problem faced by one of the major safari airline companies in Tanzania. Given a set of daily passenger requests and a fleet of heterogeneous airplanes, the problem requires to determine the best set of itineraries to transport the passengers from their origins to the requested destinations within specific time windows, while satisfying a number of operational constraints. The aim is to minimize user inconvenience, measured by delays with respect to the pre-defined time windows and by the number of intermediate stops in the itineraries, and operational cost. The problem is complicated by the high number of daily requests in peak touristic periods, and by the fact that refueling is possible only at a limited number of airstrips. We solve the problem by means of an adaptive large neighborhood search, which we enrich with local search operators and a set partitioning model. Extensive computational tests on real-world instances prove the effectiveness of the proposed algorithm, which can improve the solutions found by the company both in terms of operational cost and user inconvenience, in reasonable computational time.
{"title":"Minimizing user inconvenience and operational costs in a dial-a-flight problem for flying safaris","authors":"J. Cordeau, M. Iori, N. F. M. Mendes, Davide Nelli, Riccardo Tedeschi","doi":"10.1080/03155986.2022.2129210","DOIUrl":"https://doi.org/10.1080/03155986.2022.2129210","url":null,"abstract":"Abstract We study a Dial-a-Flight Problem faced by one of the major safari airline companies in Tanzania. Given a set of daily passenger requests and a fleet of heterogeneous airplanes, the problem requires to determine the best set of itineraries to transport the passengers from their origins to the requested destinations within specific time windows, while satisfying a number of operational constraints. The aim is to minimize user inconvenience, measured by delays with respect to the pre-defined time windows and by the number of intermediate stops in the itineraries, and operational cost. The problem is complicated by the high number of daily requests in peak touristic periods, and by the fact that refueling is possible only at a limited number of airstrips. We solve the problem by means of an adaptive large neighborhood search, which we enrich with local search operators and a set partitioning model. Extensive computational tests on real-world instances prove the effectiveness of the proposed algorithm, which can improve the solutions found by the company both in terms of operational cost and user inconvenience, in reasonable computational time.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"127 1","pages":"104 - 140"},"PeriodicalIF":1.3,"publicationDate":"2022-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75973188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-08DOI: 10.1080/03155986.2022.2106713
A. Gharehgozli, Nima Zaerpour, Kunpeng Li
Abstract Container terminals play an essential role in the current global supply chain, and their efficiency influences businesses throughout the supply chain. One of the most critical decisions in the operation of container terminals is the number of deployed rubber tyred gantry (RTG) cranes to handle the containers. The RTG crane is the main equipment that handles containers in the stacking area of many container terminals worldwide. Every shift, container terminal operators decide how many RTG cranes are needed to stack and retrieve containers. This decision, if made optimally, can significantly improve the daily throughput of terminals and dramatically reduce port congestion. This article aims to determine the optimal number of RTG cranes in a container terminal by formulating the problem as a mixed-integer linear program. Our proposed formulation can find optimal solutions efficiently, usually in less than a second. The results show that the workload, storage capacity, and shift duration significantly influence the optimal number of RTG cranes.
{"title":"Optimizing the number of deployed yard cranes in a container terminal","authors":"A. Gharehgozli, Nima Zaerpour, Kunpeng Li","doi":"10.1080/03155986.2022.2106713","DOIUrl":"https://doi.org/10.1080/03155986.2022.2106713","url":null,"abstract":"Abstract Container terminals play an essential role in the current global supply chain, and their efficiency influences businesses throughout the supply chain. One of the most critical decisions in the operation of container terminals is the number of deployed rubber tyred gantry (RTG) cranes to handle the containers. The RTG crane is the main equipment that handles containers in the stacking area of many container terminals worldwide. Every shift, container terminal operators decide how many RTG cranes are needed to stack and retrieve containers. This decision, if made optimally, can significantly improve the daily throughput of terminals and dramatically reduce port congestion. This article aims to determine the optimal number of RTG cranes in a container terminal by formulating the problem as a mixed-integer linear program. Our proposed formulation can find optimal solutions efficiently, usually in less than a second. The results show that the workload, storage capacity, and shift duration significantly influence the optimal number of RTG cranes.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"63 1","pages":"86 - 103"},"PeriodicalIF":1.3,"publicationDate":"2022-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89685478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-28DOI: 10.1080/03155986.2022.2104573
Dawei Wang, Fangqing Wei, Fengwei Yang
Abstract This study explores the additive decomposition method in which the overall efficiency is a weighted average of the two stage efficiencies in a feedback system. In the additive decomposition method, the weight is often expressed as the proportion of total resources devoted to each stage, reflecting the relative importance of the stage. When this approach of determining weights is used in the additive two-stage data envelopment analysis (DEA) model with feedback, we find that the weight of the first stage is never less than that of the second stage, indicating that the first stage is favored, which causes a biased efficiency evaluation. Additionally, the weight of the first stage decreases when its efficiency increases, which does not conform to the belief that to maximize the overall efficiencies, a larger weight should be assigned to the stage with higher efficiency. In this study, we build an improved feedback two-stage DEA model with constant weights and develop a heuristic method to solve it. An empirical dataset covering the high-tech industry of 30 regions in mainland China in 2019 is studied to illustrate the applicability and superiority of our improved model.
{"title":"Efficiency evaluation of a two-stage production process with feedback: an improved DEA model","authors":"Dawei Wang, Fangqing Wei, Fengwei Yang","doi":"10.1080/03155986.2022.2104573","DOIUrl":"https://doi.org/10.1080/03155986.2022.2104573","url":null,"abstract":"Abstract This study explores the additive decomposition method in which the overall efficiency is a weighted average of the two stage efficiencies in a feedback system. In the additive decomposition method, the weight is often expressed as the proportion of total resources devoted to each stage, reflecting the relative importance of the stage. When this approach of determining weights is used in the additive two-stage data envelopment analysis (DEA) model with feedback, we find that the weight of the first stage is never less than that of the second stage, indicating that the first stage is favored, which causes a biased efficiency evaluation. Additionally, the weight of the first stage decreases when its efficiency increases, which does not conform to the belief that to maximize the overall efficiencies, a larger weight should be assigned to the stage with higher efficiency. In this study, we build an improved feedback two-stage DEA model with constant weights and develop a heuristic method to solve it. An empirical dataset covering the high-tech industry of 30 regions in mainland China in 2019 is studied to illustrate the applicability and superiority of our improved model.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"212 1","pages":"67 - 85"},"PeriodicalIF":1.3,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74758179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-06DOI: 10.1080/03155986.2022.2094632
Huimin Zhang, Z. Lou, Fujun Hou
Abstract Information sharing has been regarded as a way to coordinate or to optimize the whole supply chain. Prior literature focuses on unilateral information sharing in a supply chain with single or substitutable products. This paper explores bilateral demand information sharing in a supply chain, in which two competing manufacturers provide substitutable products to a common retailer. All supply chain members have partial forecast information about the market demand. We establish three pricing decision models and derive the corresponding results by backward induction to study the effects of bilateral information sharing on pricing and expected profits of supply chain members under three information sharing strategies. The results show that (i) information sharing decreases the positive effect of manufacturer’s demand forecast on the optimal price, but increases the positive effect of retailer’s demand forecast; (ii) information sharing benefits two manufacturers and hurts the retailer, whereas benefits the whole supply chain under certain conditions; (iii) the retailer prefers to share information with one of manufacturers rather than both of manufacturers. Finally, we also provide some managerial insights with the help of computational studies.
{"title":"Bilateral information sharing in a supply chain with manufacturer competition","authors":"Huimin Zhang, Z. Lou, Fujun Hou","doi":"10.1080/03155986.2022.2094632","DOIUrl":"https://doi.org/10.1080/03155986.2022.2094632","url":null,"abstract":"Abstract Information sharing has been regarded as a way to coordinate or to optimize the whole supply chain. Prior literature focuses on unilateral information sharing in a supply chain with single or substitutable products. This paper explores bilateral demand information sharing in a supply chain, in which two competing manufacturers provide substitutable products to a common retailer. All supply chain members have partial forecast information about the market demand. We establish three pricing decision models and derive the corresponding results by backward induction to study the effects of bilateral information sharing on pricing and expected profits of supply chain members under three information sharing strategies. The results show that (i) information sharing decreases the positive effect of manufacturer’s demand forecast on the optimal price, but increases the positive effect of retailer’s demand forecast; (ii) information sharing benefits two manufacturers and hurts the retailer, whereas benefits the whole supply chain under certain conditions; (iii) the retailer prefers to share information with one of manufacturers rather than both of manufacturers. Finally, we also provide some managerial insights with the help of computational studies.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"27 1","pages":"505 - 530"},"PeriodicalIF":1.3,"publicationDate":"2022-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90247898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：