首页 > 最新文献

Omega-international Journal of Management Science最新文献

英文 中文
An optimization model for determining cost-efficient maintenance policies for multi-component systems with economic and structural dependencies 为具有经济和结构依赖性的多组件系统确定具有成本效益的维护政策的优化模型
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-23 DOI: 10.1016/j.omega.2024.103162
Jussi Leppinen , Antti Punkka , Tommi Ekholm , Ahti Salo

In most multi-component systems, the cost-efficiency of maintenance policies depends on technical structural dependencies. Motivated by the recognition that these dependencies must be accounted for in the development of optimal maintenance policies, we develop an optimization model to determine cost-efficient maintenance schedules for multi-component systems. Our main contribution is twofold. First, we introduce directed graphs as an expressive tool to represent the economic and structural dependencies of the system, including situations in which the maintenance of a given component may require other components to be disassembled or maintained. Second, we formulate a Markov Decision Process model, which is solved through the modified policy-iteration algorithm to determine the most cost-efficient policy. This policy indicates which maintenance actions consisting of disassembly and component replacement decisions are optimal when mandatory replacements must be made whenever the system fails, or the reliability of the system falls below a predefined reliability threshold. To our knowledge, this is the first model that provides optimal maintenance policies that comply with reliability requirements in the presence of constraints arising from technical structural dependencies. We illustrate the model with a realistic case study on the development of cost-efficient maintenance policies and show that its results compare favorably with heuristic maintenance policies.

在大多数多组件系统中,维护政策的成本效益取决于技术结构依赖性。我们认识到,在制定最佳维护政策时必须考虑到这些依赖关系,因此我们开发了一个优化模型,用于确定多组件系统具有成本效益的维护计划。我们的主要贡献有两方面。首先,我们引入了有向图作为表达工具,用于表示系统的经济和结构依赖关系,包括特定组件的维护可能需要拆卸或维护其他组件的情况。其次,我们建立了一个马尔可夫决策过程模型,通过改进的策略迭代算法来确定最具成本效益的策略。当系统出现故障或系统可靠性低于预定的可靠性阈值时,就必须进行强制更换,这时该策略就能指出哪些由拆卸和部件更换决策组成的维护行动是最优的。据我们所知,这是第一个提供符合可靠性要求的最优维护策略的模型,同时还存在由技术结构依赖性引起的约束条件。我们通过一个关于制定具有成本效益的维护策略的现实案例研究来说明该模型,并表明其结果优于启发式维护策略。
{"title":"An optimization model for determining cost-efficient maintenance policies for multi-component systems with economic and structural dependencies","authors":"Jussi Leppinen ,&nbsp;Antti Punkka ,&nbsp;Tommi Ekholm ,&nbsp;Ahti Salo","doi":"10.1016/j.omega.2024.103162","DOIUrl":"10.1016/j.omega.2024.103162","url":null,"abstract":"<div><p>In most multi-component systems, the cost-efficiency of maintenance policies depends on technical structural dependencies. Motivated by the recognition that these dependencies must be accounted for in the development of optimal maintenance policies, we develop an optimization model to determine cost-efficient maintenance schedules for multi-component systems. Our main contribution is twofold. First, we introduce directed graphs as an expressive tool to represent the economic and structural dependencies of the system, including situations in which the maintenance of a given component may require other components to be disassembled or maintained. Second, we formulate a Markov Decision Process model, which is solved through the modified policy-iteration algorithm to determine the most cost-efficient policy. This policy indicates which maintenance actions consisting of disassembly and component replacement decisions are optimal when mandatory replacements must be made whenever the system fails, or the reliability of the system falls below a predefined reliability threshold. To our knowledge, this is the first model that provides optimal maintenance policies that comply with reliability requirements in the presence of constraints arising from technical structural dependencies. We illustrate the model with a realistic case study on the development of cost-efficient maintenance policies and show that its results compare favorably with heuristic maintenance policies.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"130 ","pages":"Article 103162"},"PeriodicalIF":6.7,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305048324001270/pdfft?md5=bce25ab1996813025fcbf877ec758cfb&pid=1-s2.0-S0305048324001270-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Online commodity recommendation model for interaction between user ratings and intensity-weighted hierarchical sentiment: A case study of LYCOM 用户评分与强度加权分层情感互动的在线商品推荐模型:LYCOM 案例研究
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-22 DOI: 10.1016/j.omega.2024.103161
Chonghui Zhang , Na Zhang , Weihua Su , Tomas Balezentis

The online commodity recommendation (OCR) model mines users’ historical behavior characteristics and recommends products that may be of interest according to user preferences. Online reviews are among the most important information sources for OCR. However, the explicit and implicit emotional words in online review texts have different structures in the expression of multi-attribute emotions. To fully utilize review information and improve the recommendation accuracy, we propose an OCR model that considers the interaction of multiple attributes and hierarchical emotions and calculates a score weighted by emotion intensity. First, to balance the efficiency and accuracy of information extraction while considering the coexistence of explicit and implicit expressions in online review text, a multi-attribute hierarchical emotion lexicon construction method is proposed. Second, based on the advantage of intuitionistic fuzzy sets in terms of information expression superiority, multi-attribute review text information expression of the affective polarity and intensity of online review text is realized. Then, combined with the weighted singular value decomposition and factorization machine method, we propose an OCR model for interactions between multi-attribute emotions and scores through fusion and recombination of the eigenvectors of users and products. Finally, tourism products on the LYCOM website are used as an example to verify the effectiveness of the proposed method.

在线商品推荐(OCR)模型挖掘用户的历史行为特征,并根据用户偏好推荐其可能感兴趣的商品。在线评论是 OCR 最重要的信息来源之一。然而,在线评论文本中的显性情感词和隐性情感词在表达多属性情感时具有不同的结构。为了充分利用评论信息并提高推荐准确率,我们提出了一种考虑多属性和分层情感交互的 OCR 模型,并计算出按情感强度加权的分数。首先,为了兼顾信息提取的效率和准确性,同时考虑到在线评论文本中显性表达和隐性表达并存的特点,我们提出了一种多属性分层情感词典构建方法。其次,基于直觉模糊集在信息表达优越性方面的优势,实现了网络评论文本情感极性和强度的多属性评论文本信息表达。然后,结合加权奇异值分解和因式分解机方法,通过对用户和产品的特征向量进行融合重组,提出了多属性情感与评分交互的OCR模型。最后,以 LYCOM 的旅游产品为例,验证了所提方法的有效性。
{"title":"Online commodity recommendation model for interaction between user ratings and intensity-weighted hierarchical sentiment: A case study of LYCOM","authors":"Chonghui Zhang ,&nbsp;Na Zhang ,&nbsp;Weihua Su ,&nbsp;Tomas Balezentis","doi":"10.1016/j.omega.2024.103161","DOIUrl":"10.1016/j.omega.2024.103161","url":null,"abstract":"<div><p>The online commodity recommendation (OCR) model mines users’ historical behavior characteristics and recommends products that may be of interest according to user preferences. Online reviews are among the most important information sources for OCR. However, the explicit and implicit emotional words in online review texts have different structures in the expression of multi-attribute emotions. To fully utilize review information and improve the recommendation accuracy, we propose an OCR model that considers the interaction of multiple attributes and hierarchical emotions and calculates a score weighted by emotion intensity. First, to balance the efficiency and accuracy of information extraction while considering the coexistence of explicit and implicit expressions in online review text, a multi-attribute hierarchical emotion lexicon construction method is proposed. Second, based on the advantage of intuitionistic fuzzy sets in terms of information expression superiority, multi-attribute review text information expression of the affective polarity and intensity of online review text is realized. Then, combined with the weighted singular value decomposition and factorization machine method, we propose an OCR model for interactions between multi-attribute emotions and scores through fusion and recombination of the eigenvectors of users and products. Finally, tourism products on the LYCOM website are used as an example to verify the effectiveness of the proposed method.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103161"},"PeriodicalIF":6.7,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141777973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamic learning-based search for multi-criteria itinerary planning 基于学习的多标准行程规划动态搜索
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-22 DOI: 10.1016/j.omega.2024.103159
Thomas Horstmannshoff , Jan Fabian Ehmke , Marlin W. Ulmer

Travelers expect integrated and multimodal itinerary planning while addressing their individual expectations. Besides common preferences such as travel time and price, further criteria such as walking and waiting times are of importance as well. The competing features of these preferences yield a variety of non-dominated itineraries. Finding the set of non-dominated multimodal travel itineraries in efficient run time remains a challenge in case multiple traveler preferences are considered.

In this work, we present a sampling framework to approximate the set of non-dominated travel itineraries that scales well in terms of considered preferences. In particular, we guide the search process dynamically to uncertain areas of the complex multimodal solution space. To this end, we learn the structure of the Pareto front during the search with Gaussian Process Regression (GPR). The GPR sampling framework is evaluated integrating an extensive amount of real-world data on mobility services. We analyze long-distance trips between major cities in Germany. Furthermore, we take up to five traveler preferences into account. We observe that the framework performs well, revealing the origin and destination specifics of Pareto fronts of multimodal travel itineraries.

旅行者希望在进行综合、多式联运的行程规划的同时,还能满足他们各自的期望。除了旅行时间和价格等共同偏好外,步行和等待时间等其他标准也很重要。这些偏好的竞争特征产生了各种非主导行程。在考虑多种旅客偏好的情况下,如何在高效运行时间内找到一组非主导多式联运旅行路线仍然是一项挑战。
{"title":"Dynamic learning-based search for multi-criteria itinerary planning","authors":"Thomas Horstmannshoff ,&nbsp;Jan Fabian Ehmke ,&nbsp;Marlin W. Ulmer","doi":"10.1016/j.omega.2024.103159","DOIUrl":"10.1016/j.omega.2024.103159","url":null,"abstract":"<div><p>Travelers expect integrated and multimodal itinerary planning while addressing their individual expectations. Besides common preferences such as travel time and price, further criteria such as walking and waiting times are of importance as well. The competing features of these preferences yield a variety of non-dominated itineraries. Finding the set of non-dominated multimodal travel itineraries in efficient run time remains a challenge in case multiple traveler preferences are considered.</p><p>In this work, we present a sampling framework to approximate the set of non-dominated travel itineraries that scales well in terms of considered preferences. In particular, we guide the search process dynamically to uncertain areas of the complex multimodal solution space. To this end, we learn the structure of the Pareto front during the search with Gaussian Process Regression (GPR). The GPR sampling framework is evaluated integrating an extensive amount of real-world data on mobility services. We analyze long-distance trips between major cities in Germany. Furthermore, we take up to five traveler preferences into account. We observe that the framework performs well, revealing the origin and destination specifics of Pareto fronts of multimodal travel itineraries.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103159"},"PeriodicalIF":6.7,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305048324001245/pdfft?md5=c630eab64de83637b943cbdfefb2bd74&pid=1-s2.0-S0305048324001245-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141777974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Task-service matching problem for platform-driven manufacturing-as-a-service: A one-leader and multi-follower Stackelberg game with multiple objectives 平台驱动型制造即服务的任务-服务匹配问题:一个领导者和多个追随者的多目标斯塔克尔伯格博弈
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-19 DOI: 10.1016/j.omega.2024.103157
Wenchong Chen , Pengwei Feng , Xinggang Luo , Libing Nie

Along with the increased use of digitization, platform-driven manufacturing-as-a-service (p-MaaS) is becoming an inevitable trend of the manufacturing industry. End-users openly share their personalized manufacturing tasks, which necessitates platform-based crowdsourcing to conduct manufacturing service collaboration and at last achieve efficient task-service matching (TSM). This crowdsourcing takes into account the autonomy of end-users, platforms, and manufacturing servicers, which challenges previous opinions that distributed manufacturing services must be centralized and controlled by platforms. This paper proposes a novel TSM problem for p-MaaS under the framework of crowdsourcing. The platform plays the role of allocating new emerged tasks and broadcasting to corresponding servicers. All servicers receive the broadcast information and conduct scheduling-based task acceptance (STA) independently. The above manufacturing task allocation (MTA) focuses on maximizing the net revenue of TSM and at the same time enables servicers to accept tasks as many as possible. In terms of the inherent interactive mechanism between MTA and STA, in which MTA generates a decision space for STA and STA feeds task acceptance schemes and the corresponding fulfillment costs back for use in MTA decision-making, a bilevel multi-objective optimization (BMO) is formulated to simultaneously address the two subproblems based on a Stackelberg game. The BMO is a type of multi-objective nonlinear programming, and a nested algorithm is designed to solve it. The better performance of the BMO is verified through a practical case study.

随着数字化应用的增加,平台驱动的制造即服务(p-MaaS)正成为制造业发展的必然趋势。终端用户公开分享他们的个性化制造任务,这就需要基于平台的众包来开展制造服务协作,最终实现高效的任务服务匹配(TSM)。这种众包考虑到了终端用户、平台和制造服务商的自主性,对以往认为分布式制造服务必须由平台集中控制的观点提出了挑战。本文提出了众包框架下 p-MaaS 的新型 TSM 问题。平台的作用是分配新出现的任务并广播给相应的服务商。所有服务商收到广播信息后,独立进行基于调度的任务验收(STA)。上述制造任务分配(MTA)的重点是实现 TSM 净收入的最大化,同时使服务商尽可能多地接受任务。根据 MTA 和 STA 之间固有的互动机制,即 MTA 为 STA 生成决策空间,STA 将任务接受方案和相应的履行成本反馈给 MTA 决策使用,制定了双层多目标优化(BMO)来同时解决这两个基于 Stackelberg 博弈的子问题。BMO 是一种多目标非线性编程,设计了一种嵌套算法来解决它。通过实际案例研究验证了 BMO 的较佳性能。
{"title":"Task-service matching problem for platform-driven manufacturing-as-a-service: A one-leader and multi-follower Stackelberg game with multiple objectives","authors":"Wenchong Chen ,&nbsp;Pengwei Feng ,&nbsp;Xinggang Luo ,&nbsp;Libing Nie","doi":"10.1016/j.omega.2024.103157","DOIUrl":"10.1016/j.omega.2024.103157","url":null,"abstract":"<div><p>Along with the increased use of digitization, platform-driven manufacturing-as-a-service (p-MaaS) is becoming an inevitable trend of the manufacturing industry. End-users openly share their personalized manufacturing tasks, which necessitates platform-based crowdsourcing to conduct manufacturing service collaboration and at last achieve efficient task-service matching (TSM). This crowdsourcing takes into account the autonomy of end-users, platforms, and manufacturing servicers, which challenges previous opinions that distributed manufacturing services must be centralized and controlled by platforms. This paper proposes a novel TSM problem for p-MaaS under the framework of crowdsourcing. The platform plays the role of allocating new emerged tasks and broadcasting to corresponding servicers. All servicers receive the broadcast information and conduct scheduling-based task acceptance (STA) independently. The above manufacturing task allocation (MTA) focuses on maximizing the net revenue of TSM and at the same time enables servicers to accept tasks as many as possible. In terms of the inherent interactive mechanism between MTA and STA, in which MTA generates a decision space for STA and STA feeds task acceptance schemes and the corresponding fulfillment costs back for use in MTA decision-making, a bilevel multi-objective optimization (BMO) is formulated to simultaneously address the two subproblems based on a Stackelberg game. The BMO is a type of multi-objective nonlinear programming, and a nested algorithm is designed to solve it. The better performance of the BMO is verified through a practical case study.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103157"},"PeriodicalIF":6.7,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141777975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimizing physician schedules with resilient break assignments 通过弹性休息分配优化医生日程安排
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-19 DOI: 10.1016/j.omega.2024.103154
Sebastian Kraul , Melanie Erhard , Jens O. Brunner

This article presents a novel model for building biweekly rosters for physicians according to the regulations of a German teaching hospital, while also ensuring the viability of breaks. Currently, rosters are manually prepared by experienced physicians with basic spreadsheet knowledge, leading to significant costs and time consumption because of the complexity of the problem and the individual working conditions of the physicians. Unfortunately, manually generated rosters frequently prove to be non-compliant with labor regulations and ergonomic agreements, resulting in potential overtime hours and employee dissatisfaction. A particular concern is the inability of physicians to take mandatory breaks, which negatively affects both employee motivation and the hospital service level. To address these challenges, we propose a data-driven formulation of an operational physician scheduling problem, considering overstaffing and overtime hours as primary cost drivers and integrating shift preferences and break viability as ergonomic objectives. We develop and train a survival regression model to predict the viability of breaks, allowing practitioners to define break-time windows appropriately. Given the limitations of standard solvers in producing high-quality solutions within a reasonable timeframe, we adopt a Dantzig–Wolfe decomposition to reformulate the proposed model. Furthermore, we develop a branch-and-price algorithm to achieve optimal solutions and introduce a problem-specific variable selection strategy for efficient branching. To assess the algorithm’s effectiveness and examine the impact of the new break assignment constraint, we conducted a comprehensive computational study using real-world data from a German training hospital. Using our approach, healthcare institutions can streamline the rostering process, minimize the costs associated with overstaffing and overtime hours, and improve employee satisfaction by ensuring that physicians can take their legally mandated breaks. Ultimately, this contributes to better employee motivation and improves the overall level of hospital service.

本文介绍了一种新颖的模式,用于根据德国一家教学医院的规定为医生建立双周花名册,同时确保休息时间的可行性。目前,花名册都是由经验丰富、具备基本电子表格知识的医生手工编制的,由于问题的复杂性和医生各自的工作条件,导致了大量的成本和时间消耗。遗憾的是,人工生成的花名册经常不符合劳动法规和人体工程学协议,导致潜在的加班时间和员工不满。一个特别令人担忧的问题是,医生无法强制休息,这对员工的积极性和医院的服务水平都产生了负面影响。为了应对这些挑战,我们提出了一个以数据为驱动的医生排班问题,将超员和加班时间作为主要的成本驱动因素,并将轮班偏好和休息可行性作为人体工程学目标。我们开发并训练了一个生存回归模型来预测休息时间的可行性,使从业人员能够适当地定义休息时间窗口。鉴于标准求解器在合理时间内生成高质量解决方案方面的局限性,我们采用了 Dantzig-Wolfe 分解法来重新表述所提出的模型。此外,我们还开发了一种分支-价格算法来实现最优解,并引入了针对特定问题的变量选择策略来实现高效分支。为了评估该算法的有效性并检验新的中断分配约束的影响,我们利用一家德国培训医院的实际数据进行了全面的计算研究。利用我们的方法,医疗机构可以简化名册编制流程,最大限度地降低与人员过剩和加班时间相关的成本,并通过确保医生能够依法休息来提高员工满意度。最终,这将有助于提高员工的积极性,并改善医院的整体服务水平。
{"title":"Optimizing physician schedules with resilient break assignments","authors":"Sebastian Kraul ,&nbsp;Melanie Erhard ,&nbsp;Jens O. Brunner","doi":"10.1016/j.omega.2024.103154","DOIUrl":"10.1016/j.omega.2024.103154","url":null,"abstract":"<div><p>This article presents a novel model for building biweekly rosters for physicians according to the regulations of a German teaching hospital, while also ensuring the viability of breaks. Currently, rosters are manually prepared by experienced physicians with basic spreadsheet knowledge, leading to significant costs and time consumption because of the complexity of the problem and the individual working conditions of the physicians. Unfortunately, manually generated rosters frequently prove to be non-compliant with labor regulations and ergonomic agreements, resulting in potential overtime hours and employee dissatisfaction. A particular concern is the inability of physicians to take mandatory breaks, which negatively affects both employee motivation and the hospital service level. To address these challenges, we propose a data-driven formulation of an operational physician scheduling problem, considering overstaffing and overtime hours as primary cost drivers and integrating shift preferences and break viability as ergonomic objectives. We develop and train a survival regression model to predict the viability of breaks, allowing practitioners to define break-time windows appropriately. Given the limitations of standard solvers in producing high-quality solutions within a reasonable timeframe, we adopt a Dantzig–Wolfe decomposition to reformulate the proposed model. Furthermore, we develop a branch-and-price algorithm to achieve optimal solutions and introduce a problem-specific variable selection strategy for efficient branching. To assess the algorithm’s effectiveness and examine the impact of the new break assignment constraint, we conducted a comprehensive computational study using real-world data from a German training hospital. Using our approach, healthcare institutions can streamline the rostering process, minimize the costs associated with overstaffing and overtime hours, and improve employee satisfaction by ensuring that physicians can take their legally mandated breaks. Ultimately, this contributes to better employee motivation and improves the overall level of hospital service.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103154"},"PeriodicalIF":6.7,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305048324001191/pdfft?md5=387db483beaf7d6446b96405cc3905cf&pid=1-s2.0-S0305048324001191-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141847897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A preference disaggregation-driven multiple criteria sorting model based on regret theory 基于遗憾理论的偏好分解驱动多标准排序模型
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-18 DOI: 10.1016/j.omega.2024.103150
Zhi Wen , Huchang Liao , José Rui Figueira

Regret theory is a classic behavioural decision theory, but existing literature related to the regret theory used different utility functions, reference points, and parameter values, which may lead to biased results. In this regard, this study proposes a preference disaggregation-driven multiple-criteria sorting model based on the regret theory, which can infer the values of risk- and regret-aversion parameters involved in the regret theory and category thresholds according to the preference information in both precise and imprecise forms provided by decision-makers. We analyze the utility functions applied in the regret theory, and find that the power function is more reasonable than the exponential function. We also test the reference points applied in the regret theory, and find that the results obtained using the average alternative as a reference point are similar to those obtained without setting reference points while reducing computational complexity. To infer the values of risk- and regret-aversion parameters involved in the regret theory and category thresholds, a preference disaggregation-driven multiple-criteria sorting model is developed according to the preference information in both precise and imprecise forms provided by decision-makers. An illustrative example on supplier resilience classification is provided to demonstrate the applicability of the proposed sorting model.

后悔理论是一种经典的行为决策理论,但现有与后悔理论相关的文献使用了不同的效用函数、参考点和参数值,可能导致结果偏差。为此,本研究提出了一种基于后悔理论的偏好分解驱动多标准排序模型,该模型可根据决策者提供的精确和非精确形式的偏好信息,推断出后悔理论中涉及的风险规避和后悔规避参数值以及类别阈值。我们分析了后悔理论中应用的效用函数,发现幂函数比指数函数更合理。我们还测试了后悔理论中应用的参考点,发现使用平均替代方案作为参考点得到的结果与不设置参考点得到的结果相似,同时降低了计算复杂度。为了推断后悔理论中涉及的风险和后悔规避参数值以及类别阈值,我们根据决策者提供的精确和不精确形式的偏好信息,建立了偏好分解驱动的多标准排序模型。本文提供了一个关于供应商复原力分类的示例,以证明所提排序模型的适用性。
{"title":"A preference disaggregation-driven multiple criteria sorting model based on regret theory","authors":"Zhi Wen ,&nbsp;Huchang Liao ,&nbsp;José Rui Figueira","doi":"10.1016/j.omega.2024.103150","DOIUrl":"10.1016/j.omega.2024.103150","url":null,"abstract":"<div><p>Regret theory is a classic behavioural decision theory, but existing literature related to the regret theory used different utility functions, reference points, and parameter values, which may lead to biased results. In this regard, this study proposes a preference disaggregation-driven multiple-criteria sorting model based on the regret theory, which can infer the values of risk- and regret-aversion parameters involved in the regret theory and category thresholds according to the preference information in both precise and imprecise forms provided by decision-makers. We analyze the utility functions applied in the regret theory, and find that the power function is more reasonable than the exponential function. We also test the reference points applied in the regret theory, and find that the results obtained using the average alternative as a reference point are similar to those obtained without setting reference points while reducing computational complexity. To infer the values of risk- and regret-aversion parameters involved in the regret theory and category thresholds, a preference disaggregation-driven multiple-criteria sorting model is developed according to the preference information in both precise and imprecise forms provided by decision-makers. An illustrative example on supplier resilience classification is provided to demonstrate the applicability of the proposed sorting model.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103150"},"PeriodicalIF":6.7,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141777976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient targets and reference sets in selectively convex technologies 选择性凸技术中的高效目标和参考集
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-17 DOI: 10.1016/j.omega.2024.103155
Mahmood Mehdiloo , Grammatoula Papaioannou , Victor V. Podinovski

Conventional models of data envelopment analysis (DEA) typically assume that the underlying production technology is a convex set. It is known that such assumption may be clearly unsubstantiated in certain cases. Examples include studies in which some inputs or outputs are stated as proportions or percentages, or are represented by categorical measures. Excluding such “problematic” inputs and outputs from the assumption of convexity while assuming the latter for the remaining measures leads to the notion of selective convexity. Further examples of selectively convex technologies include technologies parameterized by an environmental factor and technologies in which only the input or output sets are convex. In this paper, we consider the identification of efficient targets and reference sets of decision making units in a selectively convex technology, which has not yet been explored in the literature. We show that, for such technologies, the conventional method based on the solution of the additive DEA model may not correctly identify the reference sets and needs an adjustment.

传统的数据包络分析(DEA)模型通常假定基本生产技术是一个凸集。众所周知,这种假设在某些情况下显然是不成立的。例如,在一些研究中,某些投入或产出被表述为比例或百分比,或用分类测量来表示。将这些 "有问题 "的投入和产出排除在凸性假设之外,而对其余的衡量标准则假定凸性是后者,这就产生了选择性凸性的概念。选择性凸技术的其他例子包括以环境因素为参数的技术,以及只有输入或输出集是凸的技术。在本文中,我们考虑了如何在选择性凸技术中识别决策单元的有效目标和参考集,而这一问题在文献中还没有被探讨过。我们发现,对于此类技术,基于加法 DEA 模型求解的传统方法可能无法正确识别参考集,需要进行调整。
{"title":"Efficient targets and reference sets in selectively convex technologies","authors":"Mahmood Mehdiloo ,&nbsp;Grammatoula Papaioannou ,&nbsp;Victor V. Podinovski","doi":"10.1016/j.omega.2024.103155","DOIUrl":"10.1016/j.omega.2024.103155","url":null,"abstract":"<div><p>Conventional models of data envelopment analysis (DEA) typically assume that the underlying production technology is a convex set. It is known that such assumption may be clearly unsubstantiated in certain cases. Examples include studies in which some inputs or outputs are stated as proportions or percentages, or are represented by categorical measures. Excluding such “problematic” inputs and outputs from the assumption of convexity while assuming the latter for the remaining measures leads to the notion of selective convexity. Further examples of selectively convex technologies include technologies parameterized by an environmental factor and technologies in which only the input or output sets are convex. In this paper, we consider the identification of efficient targets and reference sets of decision making units in a selectively convex technology, which has not yet been explored in the literature. We show that, for such technologies, the conventional method based on the solution of the additive DEA model may not correctly identify the reference sets and needs an adjustment.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103155"},"PeriodicalIF":6.7,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141777977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A new multi-method decision framework for anchor selection and tenant mix allocation optimisation in shopping malls 购物中心主力店选择和租户组合分配优化的新型多方法决策框架
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-14 DOI: 10.1016/j.omega.2024.103153
David Boix-Cots , Alessio Ishizaka , Arash Moheimani , Pablo Pujadas

The increasing urbanisation and fast-paced lifestyle have heightened the importance of shopping malls in retail industry, altering traditional shopping patterns by designing efficient space and optimise time of shoppers. Due to this newly-acquired importance, these malls have become critical players in the retail industry sector. Despite their significance, current research lacks comprehensive scientific methods in two critical aspects: the classification of anchors (or magnet shops) and regular tenants, and the detailed analysis of interrelations among anchors and tenants within the shopping malls. Both aspects are heavily related to the strategic allocation of shops position within malls. For addressing these gaps, this paper introduces a multi-method framework expert system to classify anchors and tenants and to optimise their positions in the shopping mall, considering their categories and existing product relationships. This framework comprises a new sorting method, a modified ranking method, a product correlation technique based on implementing ecological dynamics, an ecological interrelation index, and a metaheuristic allocation algorithm. The practical application of this framework is demonstrated through a real-world case study, highlighting its potential to significantly improve shopping mall management and retail efficiency. The effect of the proposed framework is subject to empirical tests and comparison between layout modifications.

城市化进程和快节奏的生活方式提高了购物中心在零售业中的重要性,通过设计高效的空间和优化购物者的时间,购物中心改变了传统的购物模式。由于这种新获得的重要性,这些购物中心已成为零售业的关键角色。尽管其重要性不言而喻,但目前的研究在两个关键方面缺乏全面的科学方法:主力店(或磁性商店)和常规租户的分类,以及购物中心内主力店和租户之间相互关系的详细分析。这两个方面都与商场内商铺位置的战略分配密切相关。为了弥补这些不足,本文介绍了一种多方法框架专家系统,用于对主力店和租户进行分类,并根据其类别和现有产品关系优化其在购物中心中的位置。该框架包括一种新的排序方法、一种改进的排序方法、一种基于生态动力学的产品关联技术、一种生态关联指数和一种元启发式分配算法。该框架的实际应用通过一个真实案例研究得以展示,突出了其显著改善购物中心管理和零售效率的潜力。对所建议框架的效果进行了实证测试,并对布局修改进行了比较。
{"title":"A new multi-method decision framework for anchor selection and tenant mix allocation optimisation in shopping malls","authors":"David Boix-Cots ,&nbsp;Alessio Ishizaka ,&nbsp;Arash Moheimani ,&nbsp;Pablo Pujadas","doi":"10.1016/j.omega.2024.103153","DOIUrl":"10.1016/j.omega.2024.103153","url":null,"abstract":"<div><p>The increasing urbanisation and fast-paced lifestyle have heightened the importance of shopping malls in retail industry, altering traditional shopping patterns by designing efficient space and optimise time of shoppers. Due to this newly-acquired importance, these malls have become critical players in the retail industry sector. Despite their significance, current research lacks comprehensive scientific methods in two critical aspects: the classification of anchors (or magnet shops) and regular tenants, and the detailed analysis of interrelations among anchors and tenants within the shopping malls. Both aspects are heavily related to the strategic allocation of shops position within malls. For addressing these gaps, this paper introduces a multi-method framework expert system to classify anchors and tenants and to optimise their positions in the shopping mall, considering their categories and existing product relationships. This framework comprises a new sorting method, a modified ranking method, a product correlation technique based on implementing ecological dynamics, an ecological interrelation index, and a metaheuristic allocation algorithm. The practical application of this framework is demonstrated through a real-world case study, highlighting its potential to significantly improve shopping mall management and retail efficiency. The effect of the proposed framework is subject to empirical tests and comparison between layout modifications.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103153"},"PeriodicalIF":6.7,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305048324001178/pdfft?md5=45d4996f7c0d29f3924293e6e746fcdc&pid=1-s2.0-S0305048324001178-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141696448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel multi-attention reinforcement learning for the scheduling of unmanned shipment vessels (USV) in automated container terminals 用于自动集装箱码头无人装运船调度的多注意强化学习
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-10 DOI: 10.1016/j.omega.2024.103152
Jianxin Zhu , Weidan Zhang , Lean Yu , Xinghai Guo

To improve the operating efficiency of container terminals, we investigate a closed-loop scheduling method in an autonomous inter-terminal system that employs unmanned shipment vessels (USVs) to transport containers among operational berths (Dedicated to USVs) in seaport terminals. Our USVs scheduling model is developed by considering energy replenishment, time windows, and berth restrictions, aiming to obtain cost-saving USV transportation solutions and conflict-free paths. To solve this optimization model more efficiently, we propose the multi-attention reinforcement learning (MARL) algorithm by integrating an encoder-decoder framework and an unsupervised auxiliary network. The MARL algorithm provides instant problem-solving capabilities and benefits from extensive offline training. Experimental results demonstrate that our method can obtain efficient solutions for our USVs scheduling problem, and our algorithm outperforms other compared algorithms on computing time and solution accuracy.

为了提高集装箱码头的运营效率,我们研究了一个自主码头间系统的闭环调度方法,该系统采用无人驾驶运输船(USV)在海港码头的运营泊位(USV专用泊位)间运输集装箱。我们的 USV 调度模型考虑了能源补充、时间窗口和泊位限制等因素,旨在获得节省成本的 USV 运输方案和无冲突路径。为了更高效地解决该优化模型,我们提出了多注意强化学习(MARL)算法,该算法集成了编码器-解码器框架和无监督辅助网络。MARL 算法提供了即时解决问题的能力,并受益于广泛的离线训练。实验结果表明,我们的方法可以为 USV 调度问题获得高效的解决方案,而且我们的算法在计算时间和解决方案的准确性上都优于其他同类算法。
{"title":"A novel multi-attention reinforcement learning for the scheduling of unmanned shipment vessels (USV) in automated container terminals","authors":"Jianxin Zhu ,&nbsp;Weidan Zhang ,&nbsp;Lean Yu ,&nbsp;Xinghai Guo","doi":"10.1016/j.omega.2024.103152","DOIUrl":"10.1016/j.omega.2024.103152","url":null,"abstract":"<div><p>To improve the operating efficiency of container terminals, we investigate a closed-loop scheduling method in an autonomous inter-terminal system that employs unmanned shipment vessels (USVs) to transport containers among operational berths (Dedicated to USVs) in seaport terminals. Our USVs scheduling model is developed by considering energy replenishment, time windows, and berth restrictions, aiming to obtain cost-saving USV transportation solutions and conflict-free paths. To solve this optimization model more efficiently, we propose the multi-attention reinforcement learning (MARL) algorithm by integrating an encoder-decoder framework and an unsupervised auxiliary network. The MARL algorithm provides instant problem-solving capabilities and benefits from extensive offline training. Experimental results demonstrate that our method can obtain efficient solutions for our USVs scheduling problem, and our algorithm outperforms other compared algorithms on computing time and solution accuracy.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103152"},"PeriodicalIF":6.7,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141694418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unravelling the carbon emissions compliance in sustainable supply chains: The impacts of carbon audit cooperation 解读可持续供应链中的碳排放合规性:碳审计合作的影响
IF 6.7 2区 管理学 Q1 MANAGEMENT Pub Date : 2024-07-09 DOI: 10.1016/j.omega.2024.103143
Hongyong Fu , Yifeng Lei , Shuguang Zhang , Kexin Zhao , Yanlu Zhao

As one of the 17 Sustainable Development Goals, reducing carbon emissions is crucial to combat climate change. It has also prompted companies to comply with emission regulations and evaluate the environmental impacts of their supply chains. Yet, news and reports occasionally highlight industrial instances of noncompliance. In particular, supplier’s noncompliance is often mistakenly attributed to its downstream manufacturers. Due to this misconception, manufacturers might conduct audits to protect their reputation and sales. Moreover, because a supplier may provide components to multiple competing manufacturers, they may collaborate to share audit findings regarding the common supplier’s compliance with carbon emissions regulations. However, studies do not reveal how this audit cooperation affects stakeholder interests. Here, we introduce a stylised model to examine the effects of carbon audit cooperation on the environment, competing manufacturers, and their supplier. We identify two main effects: the free-riding and amplifying effects. The former benefits the supplier but harms the environment and competing manufacturers, while the latter presents the opposite effect. The net impact depends on the balance between these two effects, which challenges conventional beliefs about carbon emissions compliance and highlights the importance of sustainability in the industry. Finally, we explore various extensions to validate the robustness of our findings.

作为 17 项可持续发展目标之一,减少碳排放对于应对气候变化至关重要。这也促使企业遵守排放法规,评估供应链对环境的影响。然而,新闻和报道偶尔也会强调一些不合规的工业案例。特别是,供应商的不合规行为往往被错误地归咎于其下游制造商。由于这种误解,制造商可能会进行审核,以保护自己的声誉和销售。此外,由于一家供应商可能会向多家相互竞争的制造商提供零部件,因此他们可能会合作分享有关共同供应商遵守碳排放法规情况的审计结果。然而,相关研究并未揭示这种审计合作如何影响利益相关者的利益。在此,我们引入一个风格化模型来研究碳审计合作对环境、竞争制造商及其供应商的影响。我们发现了两种主要影响:搭便车效应和放大效应。前者对供应商有利,但对环境和竞争制造商不利,后者则产生相反的影响。净影响取决于这两种效应之间的平衡,这对有关碳排放合规性的传统观念提出了挑战,并凸显了该行业可持续发展的重要性。最后,我们探讨了各种扩展,以验证我们研究结果的稳健性。
{"title":"Unravelling the carbon emissions compliance in sustainable supply chains: The impacts of carbon audit cooperation","authors":"Hongyong Fu ,&nbsp;Yifeng Lei ,&nbsp;Shuguang Zhang ,&nbsp;Kexin Zhao ,&nbsp;Yanlu Zhao","doi":"10.1016/j.omega.2024.103143","DOIUrl":"10.1016/j.omega.2024.103143","url":null,"abstract":"<div><p>As one of the 17 Sustainable Development Goals, reducing carbon emissions is crucial to combat climate change. It has also prompted companies to comply with emission regulations and evaluate the environmental impacts of their supply chains. Yet, news and reports occasionally highlight industrial instances of noncompliance. In particular, supplier’s noncompliance is often mistakenly attributed to its downstream manufacturers. Due to this misconception, manufacturers might conduct audits to protect their reputation and sales. Moreover, because a supplier may provide components to multiple competing manufacturers, they may collaborate to share audit findings regarding the common supplier’s compliance with carbon emissions regulations. However, studies do not reveal how this audit cooperation affects stakeholder interests. Here, we introduce a stylised model to examine the effects of carbon audit cooperation on the environment, competing manufacturers, and their supplier. We identify two main effects: the <em>free-riding</em> and <em>amplifying</em> effects. The former benefits the supplier but harms the environment and competing manufacturers, while the latter presents the opposite effect. The net impact depends on the balance between these two effects, which challenges conventional beliefs about carbon emissions compliance and highlights the importance of sustainability in the industry. Finally, we explore various extensions to validate the robustness of our findings.</p></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"129 ","pages":"Article 103143"},"PeriodicalIF":6.7,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141696893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Omega-international Journal of Management Science
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1