Pub Date : 2024-07-23DOI: 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 , Antti Punkka , Tommi Ekholm , 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}
Pub Date : 2024-07-22DOI: 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.
{"title":"Online commodity recommendation model for interaction between user ratings and intensity-weighted hierarchical sentiment: A case study of LYCOM","authors":"Chonghui Zhang , Na Zhang , Weihua Su , 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}
Pub Date : 2024-07-22DOI: 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 , Jan Fabian Ehmke , 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}
Pub Date : 2024-07-19DOI: 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 , Pengwei Feng , Xinggang Luo , 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}
Pub Date : 2024-07-19DOI: 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.
{"title":"Optimizing physician schedules with resilient break assignments","authors":"Sebastian Kraul , Melanie Erhard , 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}
Pub Date : 2024-07-18DOI: 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 , Huchang Liao , 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}
Pub Date : 2024-07-17DOI: 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 , Grammatoula Papaioannou , 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}
Pub Date : 2024-07-14DOI: 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 , Alessio Ishizaka , Arash Moheimani , 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}
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.
{"title":"A novel multi-attention reinforcement learning for the scheduling of unmanned shipment vessels (USV) in automated container terminals","authors":"Jianxin Zhu , Weidan Zhang , Lean Yu , 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}
Pub Date : 2024-07-09DOI: 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.
{"title":"Unravelling the carbon emissions compliance in sustainable supply chains: The impacts of carbon audit cooperation","authors":"Hongyong Fu , Yifeng Lei , Shuguang Zhang , Kexin Zhao , 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}