Annals of Operations Research最新文献

{"title":"A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks","authors":"Martin Frohn,&nbsp;Steven Kelk","doi":"10.1007/s10479-024-06452-0","DOIUrl":"10.1007/s10479-024-06452-0","url":null,"abstract":"<div><p>Finding the most parsimonious tree inside a phylogenetic network with respect to a given character is an NP-hard combinatorial optimization problem that for many network topologies is essentially inapproximable. In contrast, if the network is a rooted tree, then Fitch’s well-known algorithm calculates an optimal parsimony score for that character in polynomial time. Drawing inspiration from this we here introduce a new extension of Fitch’s algorithm which runs in polynomial time and ensures an approximation factor of 2 on binary, tree-child phylogenetic networks, a popular topologically-restricted subclass of phylogenetic networks in the literature. Specifically, we show that Fitch’s algorithm can be seen as a primal-dual algorithm, how it can be extended to binary, tree-child networks and that the approximation guarantee of this extension is tight. These results for a classic problem in phylogenetics strengthens the link between polyhedral methods and phylogenetics and can aid in the study of other related optimization problems on phylogenetic networks.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"345 1","pages":"125 - 145"},"PeriodicalIF":4.4,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143108539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-channel retailing and consumers’ environmental consciousness","authors":"Peng Wang,&nbsp;Jing Shao,&nbsp;Liping Liang,&nbsp;Yu Tang","doi":"10.1007/s10479-024-06454-y","DOIUrl":"10.1007/s10479-024-06454-y","url":null,"abstract":"<div><p>Facing consumers’ growing environmental consciousness, retailers need to consider the environmental consequences when choosing between e-commerce and traditional retailing. We develop a game-theoretic model to study the retailers’ channel selection problem in the presence of consumer environmental consciousness in both monopoly and duopoly settings. We find that even though the existence of consumer environmental consciousness drives the retailer toward more eco-friendly channel strategies, there exist conditions under which the retailer’s optimal channel strategy is still misaligned with environmental and social interests. Furthermore, we show that an increase in consumers’ consciousness, though seemingly reducing consumer utility, can in fact be welfare-enhancing. A reduction in the unit environmental impact of a channel (traditional or e-commerce), on the other hand, may lead to lower social welfare due to the retailer’s insubstantial carbon abatement. Finally, contrary to the conventional wisdom that competition tends to increase social welfare, we show that with consumers’ environmental consciousness, retail competition may result in social welfare decline. Our policy implication is that even though the presence of environmentally conscious consumers pushes firms to internalize the environmental consequences of their channel strategies, environmental regulations are still necessary to achieve social welfare maximization.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"345 1","pages":"467 - 515"},"PeriodicalIF":4.4,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-024-06454-y.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143108377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Information sharing in supply chains from the market game perspective","authors":"Yinbo Feng,&nbsp;Jiamin Li","doi":"10.1007/s10479-025-06470-6","DOIUrl":"10.1007/s10479-025-06470-6","url":null,"abstract":"<div><p>This paper investigates the incentives for firms to vertically share information in a two-tier supply chain comprising a single supplier selling products to multiple retailers. We employ a wholesale market model based on the market-game mechanism, where the wholesale price is determined by both the supplier’s and retailers’ decisions. Our analysis considers two cases of private information: demand information held by the retailers and demand information held by the supplier. In the case where retailers have private demand information, we demonstrate that all retailers are willing to commit to sharing information when their information is homogeneous. When their information is heterogeneous, there may be only a portion of retailers willing to commit to sharing information. The equilibrium number of retailers who commit to sharing information is influenced by the degree of demand uncertainty, the consumer market size, and the unit cost for production. In particular, when demand uncertainty is sufficiently high and the unit cost is sufficiently large relative to the market size, all retailers are willing to share information. These findings are validated through numerical experiments conducted in general settings. Furthermore, our analysis illustrates that suppliers can incentivize retailers to share information by employing either a price-discrimination strategy or a revenue-sharing strategy. We also highlight the distinct impacts of these two strategies. In the case where the supplier holds private demand information, we show that information sharing benefits all supply chain members as well as the society.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"347 3","pages":"1311 - 1338"},"PeriodicalIF":4.4,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06470-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143925520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Arctic sea ice thickness prediction using machine learning: a long short-term memory model","authors":"Tarek Zaatar,&nbsp;Ali Cheaitou,&nbsp;Olivier Faury,&nbsp;Patrick Rigot-Muller","doi":"10.1007/s10479-024-06457-9","DOIUrl":"10.1007/s10479-024-06457-9","url":null,"abstract":"<div><p>This paper introduces and details the development of a Long Short-Term Memory (LSTM) model designed to predict Arctic ice thickness, serving as a decision-making tool for maritime navigation. By forecasting ice conditions accurately, the model aims to support safer and more efficient shipping through Arctic waters. The primary objective is to equip shipping companies and decision-makers with a reliable method for estimating ice thickness in the Arctic. This will enable them to assess the level of risk due to ice and make informed decisions regarding vessel navigation, icebreaker assistance, and optimal sailing speeds. We utilized historical ice thickness data from the Copernicus database, covering the period from 1991 to 2019. This dataset was collected and preprocessed to train and validate the LSTM predictive model for accurate ice thickness forecasting. The developed LSTM model demonstrated a high level of accuracy in predicting future ice thickness. Experiments indicated that using daily datasets, the model could forecast daily ice thickness up to 30 days ahead. With monthly datasets, it successfully predicted ice thickness up to six months in advance, with the monthly data generally yielding better performance. In practical terms, this predictive model offers a valuable tool for shipping companies exploring Arctic routes, which can reduce the distance between Asia and Europe by 40%. By providing accurate ice thickness forecasts, the model assists in compliance with the International Maritime Organization’s Polar Code and the Polar Operational Limit Assessment Risk Indexing System. This enhances navigation safety and efficiency in Arctic waters, allowing ships to determine the necessity of icebreaker assistance and optimal speeds, ultimately leading to significant cost savings and risk mitigation in the shipping industry.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"345 1","pages":"533 - 568"},"PeriodicalIF":4.4,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143108368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Sustainable vehicle route planning under uncertainty for modular integrated construction: multi-trip time-dependent VRP with time windows and data analytics","authors":"Abdelrahman E. E. Eltoukhy,&nbsp;Hashim A. Hashim,&nbsp;Mohamed Hussein,&nbsp;Waqar Ahmed Khan,&nbsp;Tarek Zayed","doi":"10.1007/s10479-024-06442-2","DOIUrl":"10.1007/s10479-024-06442-2","url":null,"abstract":"<div><p>Modular integrated construction (MiC) is an innovative construction technology that boosts automation in the construction industry by shifting most of the on-site activities to controlled production facilities. However, transporting heavy, bulky, and tailor-made MiC modules to the construction site poses economic, environmental, and social challenges. Effective transportation planning is crucial to mitigate these challenges. The vehicle routing problem (VRP) is of central importance to logistics companies in determining the optimal routes for MiC module transportation. Existing literature lacks comprehensive studies on VRP that thoroughly consider the unique aspects of MiC transportation, including the need for multi-trips of trucks between the factory and the construction site, traffic conditions, and other environmental and social impacts (e.g., carbon emissions, noise, accidents, and congestion). Neglecting these factors jeopardizes the efficiency of MiC module transportation, potentially leading to project delays and undermining the sustainability benefits of MiC. Therefore, the main objective of this study is to develop a VRP model that adequately accounts for most MiC characteristics, facilitating efficient MiC module transportation. This can be achieved by proposing a new variant for the VRP model, called a multi-trip time-dependent vehicle routing problem with time windows, uncertain unloading time, and environmental and social considerations (MT-TVRPTW-UES). The MT-TVRPTW-UES is modeled as a mixed integer linear programming model. A neural network-based algorithm is utilized to predict uncertain unloading times. Additionally, we develop an ant colony optimization (ACO)-based algorithm to solve the MT-TVRPTW-UES model, specifically designed to tackle large test instances that cannot be handled by CPLEX software. To demonstrate the viability and superiority of the MT-TVRPTW-UES model, we present two case studies based on real-world data from a large logistics company located in Hong Kong. The results show that the MT-TVRPTW-UES model significantly improves the MiC module demand satisfaction, environmental protection, and people’s social life.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"348 2","pages":"863 - 898"},"PeriodicalIF":4.4,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials","authors":"Balendu Bhooshan Upadhyay,&nbsp;Subham Poddar,&nbsp;Jen-Chih Yao,&nbsp;Xiaopeng Zhao","doi":"10.1007/s10479-024-06461-z","DOIUrl":"10.1007/s10479-024-06461-z","url":null,"abstract":"<div><p>In this paper, we investigate a class of unconstrained multiobjective optimization problems (abbreviated as, MPQs), where the components of the objective function are locally Lipschitz and quasiconvex. To solve MPQs, we introduce an inexact proximal point method with Bregman distances (abbreviated as, IPPMB) via Mordukhovich limiting subdifferentials. We establish the well-definedness of the sequence generated by the IPPMB algorithm. Based on two versions of error criteria, we introduce two variants of IPPMB, namely, IPPMB1 and IPPMB2. Moreover, we establish that the sequences generated by the IPPMB1 and IPPMB2 algorithms converge to the Pareto–Mordukhovich critical point of the problem MPQ. In addition, we derive that if the components of the objective function of MPQ are convex, then the sequences converge to the weak Pareto efficient solution of MPQ. Furthermore, we discuss the linear and superlinear convergence of the sequence generated by the IPPMB2 algorithm. We furnish several non-trivial numerical examples to demonstrate the effectiveness of the proposed algorithms and solve them by employing MATLAB R2023b. To demonstrate the applicability and significance of the IPPMB algorithm, we solve a nonsmooth large-scale sparse quasiconvex multiobjective optimization by employing MATLAB R2023b.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"345 1","pages":"417 - 466"},"PeriodicalIF":4.4,"publicationDate":"2025-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-024-06461-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143108345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Decision analysis on sustainable manufacturing practices: cross country perspective","authors":"Yongbo Li,&nbsp;Murugesan Palaniappan,&nbsp;Naser Alsaleh,&nbsp;D. Thresh Kumar,&nbsp;Abdullah A. Elfar,&nbsp;Mark Christhian Barrueta Pinto,&nbsp;Adriana Montenegro Torres","doi":"10.1007/s10479-024-06416-4","DOIUrl":"10.1007/s10479-024-06416-4","url":null,"abstract":"<div><p>Increasing concerns about climate change and waste management pressure manufacturers to innovate their practices, focusing on the environment and society without impacting the economic returns. Such concerns brought a new realm to manufacturing, sustainable manufacturing, which is a combination of economy, environment and society. Though several studies have attempted to integrate sustainability in manufacturing successfully, very few studies have been reported on sustainable manufacturing practices. Even these existing studies failed to explore the difference between implementing sustainable manufacturing in different geographical contexts. To fill this gap, this study considers four different geographical context Saudi Arabia, India, Peru and China to understand their preferences of achieving sustainable development in manufacturing through sustainable manufacturing practices. At first, common sustainable manufacturing practices were collected from literature and the same has been evaluated with case industries from Saudi Arabia, India, Peru and China. Totally 15 practices under three different dimensions have been considered in this study. From the obtained results, it can be confounded that “Integrate efficient technologies into core manufacturing system” (SP4) has been identified as key influential practices irrespective of the considered geographies. With the enlighten of these obtained results, practitioners and researchers can understood various in-depth insights on how different nations following different strategies for implementing sustainable development in manufacturing sector. Such clarity improves inhouse policy making which leads to better decision making for faster transition towards sustainable manufacturing.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"345 1","pages":"277 - 315"},"PeriodicalIF":4.4,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143108022","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Digital manufacturing and supply chain: creating benefits through operations research and artificial intelligence","authors":"Weiwei Chen,&nbsp;Tsan-Ming Choi,&nbsp;Alexandre Dolgui,&nbsp;Dmitry Ivanov,&nbsp;Erwin Pesch","doi":"10.1007/s10479-024-06450-2","DOIUrl":"10.1007/s10479-024-06450-2","url":null,"abstract":"","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"344 2-3","pages":"569 - 574"},"PeriodicalIF":4.4,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-024-06450-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142994646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Large-scale collaborative vehicle routing.","authors":"Johan Los, Frederik Schulte, Margaretha Gansterer, Richard F Hartl, Matthijs T J Spaan, Rudy R Negenborn","doi":"10.1007/s10479-021-04504-3","DOIUrl":"10.1007/s10479-021-04504-3","url":null,"abstract":"<p><p>Carriers can remarkably reduce transportation costs and emissions when they collaborate, for example through a platform. Such gains, however, have only been investigated for relatively small problem instances with low numbers of carriers. We develop auction-based methods for large-scale dynamic collaborative pickup and delivery problems, combining techniques of multi-agent systems and combinatorial auctions. We evaluate our approach in terms of both solution quality and possibilities of strategic behaviour using a real-world data set of over 12,000 orders. Hence, this study is (to the best of our knowledge) the first to assess the benefits of large-scale carrier cooperation and to propose an approach for it. First, we use iterative single-order auctions to investigate possible collaboration gains for increasing numbers of carriers. Our results show that travel costs can be reduced by up to 77% when 1000 carriers collaborate, largely increasing the gains that were previously observed in smaller-scale collaboration. We also ensure that individual rationality is guaranteed in each auction. Next, we compare this approach of multiple local auctions with an established central combinatorial auction mechanism and observe that the proposed approach performs better on large-scale instances. Furthermore, to improve solution quality, we integrate the two approaches by allowing small bundle auctions in the multi-agent system. We analyze the circumstances under which bundling is beneficial in a large-scale decentralized system and demonstrate that travel cost gains of up to 13% can be obtained for 1000 carriers. Finally, we investigate whether the system is vulnerable to cheating: we show that misrepresentation of true values by individual participants sometimes can benefit them at the cost of the collective. Although such strategic behaviour is not straightforward, we also discuss different means to prevent it.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":" ","pages":"201-233"},"PeriodicalIF":4.4,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12254086/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44336514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Synchronizing production and delivery in flow shops with time-of-use electricity pricing","authors":"Humyun Fuad Rahman,&nbsp;Tom Servranckx,&nbsp;Ripon K. Chakrabortty,&nbsp;Mario Vanhoucke,&nbsp;Sondoss El Sawah","doi":"10.1007/s10479-024-06430-6","DOIUrl":"10.1007/s10479-024-06430-6","url":null,"abstract":"<div><p>Manufacturing supply chains (SC) shift from traditional make-to-stock systems to make-to-order (MTO) systems in order to coordinate the production and distribution of complex and highly customized products. Despite the need for advanced scheduling approaches when coordinating such MTO-based SCs, there is little research focussing on practical settings that include variable processing speeds, sequence-dependent setup times (SDST) and time-of-use (TOU) electricity prices. However, these settings are important since they influence the energy consumption and the associated electricity costs have an impact on the decision-making process. Furthermore, there is also an increasing concern regarding green production in manufacturing such that the energy consumption cannot be ignored in decision making. In this study, we investigate a bi-objective energy-efficient permutation flow shop scheduling problem in MTO-based SC (EPFSPSC) with the conjoint objectives of minimising the cost of inventory, delivery, tardiness and electricity costs for production. In order to solve this problem, a genetic algorithm-based memetic algorithm is proposed and its effectiveness is demonstrated against a well-known benchmark approach. This research aims to assist production managers in making integrated production and distribution decisions, while simultaneously considering all associated costs and ensuring green manufacturing.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"345 1","pages":"371 - 403"},"PeriodicalIF":4.4,"publicationDate":"2024-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-024-06430-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143109791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}