发布求助
文献互助 智能选刊 最新文献

Asia Pac. J. Oper. Res.最新文献

筛选
英文 中文
Evolutionary Game Models of Cooperative Strategies in Blockchain-Enabled Container Transport Chains 基于区块链的集装箱运输链合作策略演化博弈模型
Asia Pac. J. Oper. Res. Pub Date : 2021-06-14 DOI: 10.1142/S0217595921400297
Zhi-Hua Hu, Ya-Jing Dong
{"title":"Evolutionary Game Models of Cooperative Strategies in Blockchain-Enabled Container Transport Chains","authors":"Zhi-Hua Hu, Ya-Jing Dong","doi":"10.1142/S0217595921400297","DOIUrl":"https://doi.org/10.1142/S0217595921400297","url":null,"abstract":"This paper describes the interaction between major and auxiliary container transport carriers (MCs and ACs) by using evolutionary game theory models, enabling them to cooperate and share information under sufficient penalties and incentives. The MCs are generally logistics service integrators, mega shipping companies, and port authorities, which affect the regulations and technology innovation much, while the ACs are rest carriers and logistics service providers. Evolutionary games are used to study the cooperative behavior between MCs and ACs in the shipping industry. As indicated by analytical studies, the cooperation between MCs and ACs will be invalid without introducing blockchain technology for adequate supervision. In peak season, an evolutionary equilibrium incurs between MCs and ACs under cooperation or non-cooperation behavior strategies. However, in off-seasons, the evolutionary equilibrium is unique in which both parties choose not to cooperate. When introducing blockchain technology for supervision, the carriers will cooperate in peak and off-seasons. Besides, through a simulation analysis of the established models, the results show that the introduction of blockchain technology can enable carriers to form cooperative alliances, resolve inefficient operations, and achieve a long-term stable equilibrium strategy. We can also apply the results for reference to the regional shipping industry.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87262374","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}
引用次数: 1
Min-Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times 在允许的放行和处理时间下，批量或批量作业的最小-最大调度
Asia Pac. J. Oper. Res. Pub Date : 2021-06-11 DOI: 10.1142/S0217595921500238
Yuan Gao
{"title":"Min-Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times","authors":"Yuan Gao","doi":"10.1142/S0217595921500238","DOIUrl":"https://doi.org/10.1142/S0217595921500238","url":null,"abstract":"We study the Pareto optimization scheduling on an unbounded parallel-batch machine with jobs having agreeable release dates and processing times for minimizing makespan and maximum cost simultaneously. The jobs considered in this paper are of two types: batch jobs and drop-line jobs. For batch jobs, the completion time of a job is given by the completion time of the batch containing this job. For drop-line jobs, the completion time of a job is given by the starting time of the batch containing this job plus the processing time of this job. For both of batch jobs and drop-line jobs, we present polynomial-time algorithms for finding all Pareto optimal points.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87977817","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}
引用次数: 3
Tensor Manifold with Tucker Rank Constraints 具有Tucker秩约束的张量流形
Asia Pac. J. Oper. Res. Pub Date : 2021-06-11 DOI: 10.1142/S0217595921500226
S. Chang, Ziyan Luo, L. Qi
{"title":"Tensor Manifold with Tucker Rank Constraints","authors":"S. Chang, Ziyan Luo, L. Qi","doi":"10.1142/S0217595921500226","DOIUrl":"https://doi.org/10.1142/S0217595921500226","url":null,"abstract":"Low-rank tensor approximation plays a crucial role in various tensor analysis tasks ranging from science to engineering applications. There are several important problems facing low-rank tensor approximation. First, the rank of an approximating tensor is given without checking feasibility. Second, even such approximating tensors exist, however, current proposed algorithms cannot provide global optimality guarantees. In this work, we define the low-rank tensor set (LRTS) for Tucker rank which is a union of manifolds of tensors with specific Tucker rank. We propose a procedure to describe LRTS semi-algebraically and characterize the properties of this LRTS, e.g., feasibility of tensors manifold, the equations/inequations size of LRTS, algebraic dimensions, etc. Furthermore, if the cost function for tensor approximation is polynomial type, e.g., Frobenius norm, we propose an algorithm to approximate a given tensor with Tucker rank constraints and prove the global optimality of the proposed algorithm through critical sets determined by the semi-algebraic characterization of LRTS.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73064745","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}
引用次数: 0
Bibliometric Analysis on Port and Shipping Researches in Scope of Management Science 管理学范围内港口与航运研究的文献计量分析
Asia Pac. J. Oper. Res. Pub Date : 2021-06-08 DOI: 10.1142/S0217595921400273
Xiang Xu, Huiwen Wang, Yiwei Wu, Wen Yi
{"title":"Bibliometric Analysis on Port and Shipping Researches in Scope of Management Science","authors":"Xiang Xu, Huiwen Wang, Yiwei Wu, Wen Yi","doi":"10.1142/S0217595921400273","DOIUrl":"https://doi.org/10.1142/S0217595921400273","url":null,"abstract":"With the economic growth and prosperity, ports and shipping play an increasingly important role in the national economy and international trade. Numerous studies related to the field of port and sh...","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84381925","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}
引用次数: 1
Preface: Advance Analytics in Maritime Systems 前言:海事系统的高级分析
Asia Pac. J. Oper. Res. Pub Date : 2021-06-08 DOI: 10.1142/S0217595921020012
L. Zhen
{"title":"Preface: Advance Analytics in Maritime Systems","authors":"L. Zhen","doi":"10.1142/S0217595921020012","DOIUrl":"https://doi.org/10.1142/S0217595921020012","url":null,"abstract":"","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80164537","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}
引用次数: 0
Self-Adaptive Inertial Projection and Contraction Algorithm for Monotone Variational Inequality 单调变分不等式的自适应惯性投影与收缩算法
Asia Pac. J. Oper. Res. Pub Date : 2021-06-08 DOI: 10.1142/S0217595921500214
Xue Gao, Xingju Cai, Xu-si Wang
{"title":"Self-Adaptive Inertial Projection and Contraction Algorithm for Monotone Variational Inequality","authors":"Xue Gao, Xingju Cai, Xu-si Wang","doi":"10.1142/S0217595921500214","DOIUrl":"https://doi.org/10.1142/S0217595921500214","url":null,"abstract":"In this paper, we propose a self-adaptive inertial projection and contraction algorithm, by combining backtracking search with the inertial projection and contraction algorithm, for solving monoton...","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91520424","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}
引用次数: 0
Berth Allocation in Transshipment Ports by Considering Quay Crane Coverage and Ship Fuel Consumption 考虑码头起重机覆盖和船舶燃油消耗的转运港口泊位分配
Asia Pac. J. Oper. Res. Pub Date : 2021-06-08 DOI: 10.1142/S0217595921500287
Shucheng Yu, Bochen Wang, Si Zhang, L. Zhen
{"title":"Berth Allocation in Transshipment Ports by Considering Quay Crane Coverage and Ship Fuel Consumption","authors":"Shucheng Yu, Bochen Wang, Si Zhang, L. Zhen","doi":"10.1142/S0217595921500287","DOIUrl":"https://doi.org/10.1142/S0217595921500287","url":null,"abstract":"","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90920735","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}
引用次数: 0
Herding Behavior and Liquidity in the Cryptocurrency Market 加密货币市场中的羊群行为和流动性
Asia Pac. J. Oper. Res. Pub Date : 2021-06-08 DOI: 10.1142/S0217595921400212
Sonia Arsi, K. Guesmi, Elie Bouri
{"title":"Herding Behavior and Liquidity in the Cryptocurrency Market","authors":"Sonia Arsi, K. Guesmi, Elie Bouri","doi":"10.1142/S0217595921400212","DOIUrl":"https://doi.org/10.1142/S0217595921400212","url":null,"abstract":"In view of explosive trends and excessive trades in the cryptocurrency markets, this paper contributes to the existing literature by bringing in the limelight the effect of liquidity on the herding...","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73580290","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}
引用次数: 7
Cooperative Promotion of Cross-Market Firms Adopting 3D Printing Technology 跨市场企业采用3D打印技术的合作推动
Asia Pac. J. Oper. Res. Pub Date : 2021-06-03 DOI: 10.1142/S0217595921400285
Ke Yan, Guowei Hua, T. Cheng
{"title":"Cooperative Promotion of Cross-Market Firms Adopting 3D Printing Technology","authors":"Ke Yan, Guowei Hua, T. Cheng","doi":"10.1142/S0217595921400285","DOIUrl":"https://doi.org/10.1142/S0217595921400285","url":null,"abstract":"Traditionally, firms often run independent promotional activities to attract consumers and improve their competitiveness. With the rapid development of three-dimensional (3D) printing, also known as additive manufacturing, a growing number of firms in different markets cooperate to conduct cooperative promotion to meet consumer demand. Different from independent promotion, which means that firms promote their products through their individual promotional activities, when they carry out cooperative promotion, in addition to their individual promotional activities, they also carry out a series of cooperative promotional activities to promote their products. For such cross-market cooperation, it is of importance to consider the unit cost of production and the promotion cost to achieve competitive advantage and sustainability of the supply chain. We develop game-theoretic models to investigate the factors that make firms pursue cooperative promotion and how cooperative promotion affects their optimal decisions. We find that whether or not the firms join cooperative promotion mainly depends on the impacts of price, individual promotional activities, and cooperative promotional activities on demand, as well as the unit cost of production. Whether or not firms are willing to make more contribution to cooperative promotion depends on the difference between the efforts of individual promotional activities and cooperative promotional activities. In addition, as the consumer demand for the product increases, the firms will also increase their investments in cooperative and independent promotional activities. Moreover, as the unit cost of production and the impact of cooperative promotional activities on demand change, pursuing cooperative promotion is not necessarily more profitable than pursuing independent promotion.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88064950","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}
引用次数: 0
Feeder Ship Size Optimization in Maritime Markets with Uncertainty 具有不确定性的海运市场中的支线船尺寸优化
Asia Pac. J. Oper. Res. Pub Date : 2021-06-01 DOI: 10.1142/s021759592040014x
Hongtao Hu, Jiaoyang Mo, Lufei Huang
{"title":"Feeder Ship Size Optimization in Maritime Markets with Uncertainty","authors":"Hongtao Hu, Jiaoyang Mo, Lufei Huang","doi":"10.1142/s021759592040014x","DOIUrl":"https://doi.org/10.1142/s021759592040014x","url":null,"abstract":"This paper considers the ship size optimization problem for a liner shipping company that provides feeder service between one hub port and one feeder port. In the maritime market with uncertainty, this problem becomes more challenging. This research first analyzes the decision behaviors of the shipping company. Then, a stochastic dynamic programming method is proposed to calculate the expected total volume of containers transported within the planning horizon. Using the calculated volumes as input parameters calculate the profit of each ship sizes and then determine the suitable ship size for the feeder route. Numerical experiments are performed to validate the effectiveness of the proposed method and the efficiency of the proposed algorithm.","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80213517","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信