Pub Date : 2021-05-29DOI: 10.1142/S0217595921400261
Zheyi Tan, Haolin Li, Huiwen Wang, Qiyu Qian
This paper investigates the integrated planning problem of fleet deployment considering demand uncertainty for container shipping liners. In the daily operation of container shipping networks with ...
研究了考虑需求不确定性的集装箱班轮船队部署综合规划问题。在集装箱航运网络的日常运营中…
{"title":"Maritime Container Shipping Fleet Deployment Considering Demand Uncertainty","authors":"Zheyi Tan, Haolin Li, Huiwen Wang, Qiyu Qian","doi":"10.1142/S0217595921400261","DOIUrl":"https://doi.org/10.1142/S0217595921400261","url":null,"abstract":"This paper investigates the integrated planning problem of fleet deployment considering demand uncertainty for container shipping liners. In the daily operation of container shipping networks with ...","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87496310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-05-29DOI: 10.1142/S0217595921400236
Yeming Dai, Yao Qi, Lu Li, Hongwei Gao
In this paper, an advertising differential game model is proposed to describe the competition among different power retailers for attracting users in continuous time. After the equilibrium of adver...
本文提出了一个广告差分博弈模型来描述连续时间内不同电力零售商为吸引用户而进行的竞争。均衡后的广告…
{"title":"A Real-Time Pricing Scheme with Advertisement Competition Based on Multi-Leader-Multi-Follower Game in Smart Community","authors":"Yeming Dai, Yao Qi, Lu Li, Hongwei Gao","doi":"10.1142/S0217595921400236","DOIUrl":"https://doi.org/10.1142/S0217595921400236","url":null,"abstract":"In this paper, an advertising differential game model is proposed to describe the competition among different power retailers for attracting users in continuous time. After the equilibrium of adver...","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73083880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-05-27DOI: 10.1142/S021759592140025X
Chenlu Ji, Min Gao, Xu Zhang, Jiaxuan Li
Many flights experience delays at the airport due to bad weather, temporary closures of airports, unscheduled maintenance, etc., which emphasizes the urgent need for disruption management. It is widely accepted for Chinese airline companies to determine the flight timetable according to the lexicographic preference of flight priorities. Flight schedulers usually deal with the preceding flights as important as the latter flight of a higher priority. In this paper, we propose a build-in flight feasibility verification algorithm to improve the rescheduling algorithm. A novel model of the feasibility verification problem is given, which is equivalent to the model of a maximum clique problem for networks. Examples and tests show the advantage of our algorithm, and the algorithm runs fairly quickly and can be plugged in other scheduling algorithms easily.
{"title":"A Novel Rescheduling Algorithm for the Airline Recovery with Flight Priorities and Airport Capacity Constraints","authors":"Chenlu Ji, Min Gao, Xu Zhang, Jiaxuan Li","doi":"10.1142/S021759592140025X","DOIUrl":"https://doi.org/10.1142/S021759592140025X","url":null,"abstract":"Many flights experience delays at the airport due to bad weather, temporary closures of airports, unscheduled maintenance, etc., which emphasizes the urgent need for disruption management. It is widely accepted for Chinese airline companies to determine the flight timetable according to the lexicographic preference of flight priorities. Flight schedulers usually deal with the preceding flights as important as the latter flight of a higher priority. In this paper, we propose a build-in flight feasibility verification algorithm to improve the rescheduling algorithm. A novel model of the feasibility verification problem is given, which is equivalent to the model of a maximum clique problem for networks. Examples and tests show the advantage of our algorithm, and the algorithm runs fairly quickly and can be plugged in other scheduling algorithms easily.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77085020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-05-21DOI: 10.1142/S0217595921500263
H. Sadeghi, M. Esmaeili
Multilevel programming appears in many decision-making situations. Investigation of the main properties of quasiconcave multilevel programming (QCMP) problems, to date, is limited to bilevel programming (only two levels). In this paper, first, we present an extension of the properties of quasiconcave bilevel programming (QCBP) problems for the case when three levels exist. Then, by induction on [Formula: see text] (the number of levels), we prove the existence of an extreme point of the polyhedral constraint region that solves the QCMP problem under given conditions. Ultimately, a number of numerical examples are illustrated to verify the results.
{"title":"On the Quasiconcave Multilevel Programming Problems","authors":"H. Sadeghi, M. Esmaeili","doi":"10.1142/S0217595921500263","DOIUrl":"https://doi.org/10.1142/S0217595921500263","url":null,"abstract":"Multilevel programming appears in many decision-making situations. Investigation of the main properties of quasiconcave multilevel programming (QCMP) problems, to date, is limited to bilevel programming (only two levels). In this paper, first, we present an extension of the properties of quasiconcave bilevel programming (QCBP) problems for the case when three levels exist. Then, by induction on [Formula: see text] (the number of levels), we prove the existence of an extreme point of the polyhedral constraint region that solves the QCMP problem under given conditions. Ultimately, a number of numerical examples are illustrated to verify the results.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83318385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-05-05DOI: 10.1142/S0217595921500184
Kuo-Hao Chang, R. Cuckler
Automated material handling systems (AMHS) have been widely used in semiconductor manufacturing. However, the performance of AMHS heavily hinges on vehicle fleet sizing, which is a complex yet crucial problem. For example, a small fleet size may increase the average wait time, but a large fleet size can also result in traffic congestion. This tradeoff is difficult and can be further exacerbated by profound uncertainty in the manufacturing process. In the literature, the existing models are focused on improving the mean-based performance of AMHS, where the resulting optimal vehicle fleet size is fixed, lacking the ability and flexibility to respond to the changes and/or special requirements that suddenly come up in the manufacturing process. Another drawback with the existing models is that they are not able to characterize the upside/downside risks associated with the resulting vehicle fleet size. This paper, motivated by a real project, presents a novel quantile-based decision model to fill the gap. The adjustment of [Formula: see text] values in the proposed decision model allows for agile vehicle fleet sizing according to the production situations, resulting in the satisfactory performance of AMHS. We develop a simulation optimization solution method, called ES-AMHS in short, to enable the efficient derivation of the optimal vehicle fleet size. A comprehensive numerical analysis is conducted to evaluate the efficiency and efficacy of the solution method. Finally, an empirical study in cooperation with a wafer fab in Taiwan is presented to show the practical usefulness of this methodology in a real-world setting.
{"title":"Applying Simulation Optimization for Agile Vehicle Fleet Sizing of Automated Material Handling Systems in Semiconductor Manufacturing","authors":"Kuo-Hao Chang, R. Cuckler","doi":"10.1142/S0217595921500184","DOIUrl":"https://doi.org/10.1142/S0217595921500184","url":null,"abstract":"Automated material handling systems (AMHS) have been widely used in semiconductor manufacturing. However, the performance of AMHS heavily hinges on vehicle fleet sizing, which is a complex yet crucial problem. For example, a small fleet size may increase the average wait time, but a large fleet size can also result in traffic congestion. This tradeoff is difficult and can be further exacerbated by profound uncertainty in the manufacturing process. In the literature, the existing models are focused on improving the mean-based performance of AMHS, where the resulting optimal vehicle fleet size is fixed, lacking the ability and flexibility to respond to the changes and/or special requirements that suddenly come up in the manufacturing process. Another drawback with the existing models is that they are not able to characterize the upside/downside risks associated with the resulting vehicle fleet size. This paper, motivated by a real project, presents a novel quantile-based decision model to fill the gap. The adjustment of [Formula: see text] values in the proposed decision model allows for agile vehicle fleet sizing according to the production situations, resulting in the satisfactory performance of AMHS. We develop a simulation optimization solution method, called ES-AMHS in short, to enable the efficient derivation of the optimal vehicle fleet size. A comprehensive numerical analysis is conducted to evaluate the efficiency and efficacy of the solution method. Finally, an empirical study in cooperation with a wafer fab in Taiwan is presented to show the practical usefulness of this methodology in a real-world setting.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82629926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-28DOI: 10.1142/S0217595921400224
Yiwei Wu, Shuaian Wang, Ying Chen, Daofang Chang
Strict limits on air emissions released by burning fuel of ships have recently been imposed in Emission Control Areas. Retrofitting ships to use Liquefied Natural Gas (LNG) as a ship fuel is one of the methods for liner companies to comply with global regulations. Since the LNG retrofitting investment is expensive, it is likely that liner companies need a more scientific methodology to evaluate the LNG for propulsion of ships. Liner companies are particularly interested in their profits determined by the pricing decision. Based on the evolutionary game theory, this paper develops a mathematical model for the pricing problem with the consideration of market competition, LNG investment, and price elasticity. We also consider several realistic factors, such as the demand sensitivity for LNG effort, to make the proposed methodology meet the realistic demands when more and more liner companies need a revolutionary transformation because of the stricter regulations. Numerical experiments, including a simulated-data case, are performed to validate the proposed methodology. Some managerial insights are concluded according to the computational experiments and sensitivity analysis.
{"title":"Evaluation of Liquefied Natural Gas as a Ship Fuel for Liner Shipping Using Evolutionary Game Theory","authors":"Yiwei Wu, Shuaian Wang, Ying Chen, Daofang Chang","doi":"10.1142/S0217595921400224","DOIUrl":"https://doi.org/10.1142/S0217595921400224","url":null,"abstract":"Strict limits on air emissions released by burning fuel of ships have recently been imposed in Emission Control Areas. Retrofitting ships to use Liquefied Natural Gas (LNG) as a ship fuel is one of the methods for liner companies to comply with global regulations. Since the LNG retrofitting investment is expensive, it is likely that liner companies need a more scientific methodology to evaluate the LNG for propulsion of ships. Liner companies are particularly interested in their profits determined by the pricing decision. Based on the evolutionary game theory, this paper develops a mathematical model for the pricing problem with the consideration of market competition, LNG investment, and price elasticity. We also consider several realistic factors, such as the demand sensitivity for LNG effort, to make the proposed methodology meet the realistic demands when more and more liner companies need a revolutionary transformation because of the stricter regulations. Numerical experiments, including a simulated-data case, are performed to validate the proposed methodology. Some managerial insights are concluded according to the computational experiments and sensitivity analysis.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91442511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-20DOI: 10.1142/S0217595921400145
Xueling Zhou, Mei-xia Li, Hai-tao Che
In this paper, we study the split equality fixed point problem and propose a new iterative algorithm with a self-adaptive stepsize that does not need the prior information of the operator norms and is calculated easily. The L-Lipschitz and quasi-pseudo-contractive mappings are chosen as the operators in the algorithm since they have a wider range of applications. Moreover, we prove that the sequence generated by the algorithm strongly converges to the solution of the problem. Finally, we check the feasibility and effectiveness of the algorithm by comparing with other algorithms.
{"title":"A Strong Convergence Theorem for Solving the Split Equality Fixed Point Problem","authors":"Xueling Zhou, Mei-xia Li, Hai-tao Che","doi":"10.1142/S0217595921400145","DOIUrl":"https://doi.org/10.1142/S0217595921400145","url":null,"abstract":"In this paper, we study the split equality fixed point problem and propose a new iterative algorithm with a self-adaptive stepsize that does not need the prior information of the operator norms and is calculated easily. The L-Lipschitz and quasi-pseudo-contractive mappings are chosen as the operators in the algorithm since they have a wider range of applications. Moreover, we prove that the sequence generated by the algorithm strongly converges to the solution of the problem. Finally, we check the feasibility and effectiveness of the algorithm by comparing with other algorithms.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82850111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-17DOI: 10.1142/S0217595921400121
S. Ghobadi, Khosro Soleimani-Chamkhorami
This paper studies the problem of target setting for a generated entity from a merger among two or more decision making units. Identification of the inherited input/output levels from merging decision-making units is an important issue. In this study, a novel inverse data envelopment analysis model is introduced for target setting of a merger in the presence of fuzzy data. This model enables the merged unit to recognize the required input/output levels from merging units to achieve a predefined efficiency target. Moreover, a fuzzy linear programming model is presented for estimating the minimum attainable efficiency score through a given merging. Then, the performance of the proposed method is examined through a banking application.
{"title":"Merging Decision-Making Units with Fuzzy Data","authors":"S. Ghobadi, Khosro Soleimani-Chamkhorami","doi":"10.1142/S0217595921400121","DOIUrl":"https://doi.org/10.1142/S0217595921400121","url":null,"abstract":"This paper studies the problem of target setting for a generated entity from a merger among two or more decision making units. Identification of the inherited input/output levels from merging decision-making units is an important issue. In this study, a novel inverse data envelopment analysis model is introduced for target setting of a merger in the presence of fuzzy data. This model enables the merged unit to recognize the required input/output levels from merging units to achieve a predefined efficiency target. Moreover, a fuzzy linear programming model is presented for estimating the minimum attainable efficiency score through a given merging. Then, the performance of the proposed method is examined through a banking application.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91553088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-17DOI: 10.1142/S0217595921500202
Youyicun Lin, Shenglong Hu
In this paper, a complete characterization of the B-subdifferential of the projection onto the generalized simplex is given. This work is accomplished with the help of Han–Sun Jacobian, whose full characterization is also given in this case. The characterizations are given with simple and explicit formulae in terms of the active index set of the projection.
{"title":"B-Subdifferentials of the Projection onto the Generalized Simplex","authors":"Youyicun Lin, Shenglong Hu","doi":"10.1142/S0217595921500202","DOIUrl":"https://doi.org/10.1142/S0217595921500202","url":null,"abstract":"In this paper, a complete characterization of the B-subdifferential of the projection onto the generalized simplex is given. This work is accomplished with the help of Han–Sun Jacobian, whose full characterization is also given in this case. The characterizations are given with simple and explicit formulae in terms of the active index set of the projection.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76099411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-04-17DOI: 10.1142/S0217595921400200
Xiutian Shi, Shun-Yuan Yao, Yizhong Ma
Copycat issues and unreliable purchasing agents have challenged cross-border consumption and hurt the brands and online platforms significantly. We explicate a setting in which a platform orders from a brand, then sells and competes with the purchasing agents in an overseas market. Worried about the copycat issues, consumers undertake risk when purchasing from both platforms and agents. The blockchain adoption may help release this uncertainty by purchasing from a platform. We show the values and impacts of this new technology on the platform, brand and consumers. It is interesting to observe that the platform does not always have incentive to adopt blockchain, even if it is costless. In the presence of blockchain, we show that the revenue sharing, two-part tariff and profit sharing contracts can achieve supply chain coordination, but the cost sharing contract fails to do so. In the extended models, we discuss what will happen when the brand decides domestic retail price and the platform links optional information nodes to blockchain.
{"title":"When and How Should Cross-Border Platforms Manage Blockchain Technology in the Presence of Purchasing Agents?","authors":"Xiutian Shi, Shun-Yuan Yao, Yizhong Ma","doi":"10.1142/S0217595921400200","DOIUrl":"https://doi.org/10.1142/S0217595921400200","url":null,"abstract":"Copycat issues and unreliable purchasing agents have challenged cross-border consumption and hurt the brands and online platforms significantly. We explicate a setting in which a platform orders from a brand, then sells and competes with the purchasing agents in an overseas market. Worried about the copycat issues, consumers undertake risk when purchasing from both platforms and agents. The blockchain adoption may help release this uncertainty by purchasing from a platform. We show the values and impacts of this new technology on the platform, brand and consumers. It is interesting to observe that the platform does not always have incentive to adopt blockchain, even if it is costless. In the presence of blockchain, we show that the revenue sharing, two-part tariff and profit sharing contracts can achieve supply chain coordination, but the cost sharing contract fails to do so. In the extended models, we discuss what will happen when the brand decides domestic retail price and the platform links optional information nodes to blockchain.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84685632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：