Pub Date : 2024-09-16DOI: 10.1007/s10479-024-06269-x
Yini Zheng, Tiaojun Xiao
The manufacturer-rebate where the manufacturer directly provides consumer rebates and the channel-rebate where the manufacturer stimulates downstream retailers to sell more products with channel rebates are two typical rebate strategies for manufacturers to increase sales. Considering the prevalence of rebate promotions and the downstream retailer’s optimism on the effect of rebating consumers, we incorporate rebate promotions, retailers’ optimism, and the corresponding information asymmetry issue into the manufacturer’s wholesale-ordering contract design problem. We find that with rebate promotions, the wholesale price and the order quantity should be higher than without rebate promotion. Specially, under the manufacturer-rebate strategy, the wholesale price and the order quantity should increase with the manufacturer’s rebate and the retailer’s optimism. However, under the channel-rebate strategy, the order quantity (the wholesale price) is no longer affected by the manufacturer’s rebate (the retailer’s optimism). Moreover, when the retailer’s optimism is private information, the retailer’s information distortion behaviors under the two rebate strategies are similar, but the manufacturer should accept different kinds of wholesale price-order quantity contract menus to reveal the retailer’s information and maximize profits. Specifically, under the manufacturer-rebate strategy (the channel-rebate strategy), differentiated contracts (a pooling contract) to different types of retailers are optimal. Besides, under the manufacturer-rebate strategy, the value of the rebate can play a moderating role in contract design. Hence, when the rebate is exogenously decided, the manufacturer can punish the retailer who is likely to distort information by decreasing the rebate.
{"title":"Interaction between rebate strategy and wholesale-ordering contracts under retailer optimism and information asymmetry","authors":"Yini Zheng, Tiaojun Xiao","doi":"10.1007/s10479-024-06269-x","DOIUrl":"https://doi.org/10.1007/s10479-024-06269-x","url":null,"abstract":"<p>The manufacturer-rebate where the manufacturer directly provides consumer rebates and the channel-rebate where the manufacturer stimulates downstream retailers to sell more products with channel rebates are two typical rebate strategies for manufacturers to increase sales. Considering the prevalence of rebate promotions and the downstream retailer’s optimism on the effect of rebating consumers, we incorporate rebate promotions, retailers’ optimism, and the corresponding information asymmetry issue into the manufacturer’s wholesale-ordering contract design problem. We find that with rebate promotions, the wholesale price and the order quantity should be higher than without rebate promotion. Specially, under the manufacturer-rebate strategy, the wholesale price and the order quantity should increase with the manufacturer’s rebate and the retailer’s optimism. However, under the channel-rebate strategy, the order quantity (the wholesale price) is no longer affected by the manufacturer’s rebate (the retailer’s optimism). Moreover, when the retailer’s optimism is private information, the retailer’s information distortion behaviors under the two rebate strategies are similar, but the manufacturer should accept different kinds of wholesale price-order quantity contract menus to reveal the retailer’s information and maximize profits. Specifically, under the manufacturer-rebate strategy (the channel-rebate strategy), differentiated contracts (a pooling contract) to different types of retailers are optimal. Besides, under the manufacturer-rebate strategy, the value of the rebate can play a moderating role in contract design. Hence, when the rebate is exogenously decided, the manufacturer can punish the retailer who is likely to distort information by decreasing the rebate.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"65 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251157","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}
Pub Date : 2024-09-14DOI: 10.1007/s10479-024-06233-9
Simeng Liu, Yashuang Wei, Guofang Nan, Dahui Li
Digital game platforms have provided “pay-to-play” (P2P) games for players to purchase and play on platforms for many years. Recently, platforms have adopted the hybrid bundling (HB) strategy that provides a bundled service of digital games in addition to P2P games. This strategy has the potential to facilitate the growth of digital games and address efficient decarbonization of physical copies of games. This study develops a theoretic model to explore whether the platform should adopt HB and, if so, what are the optimal value and price of the bundled service. We find that HB benefits profits when the usage cost of the bundled service is lower than that of P2P games, the unit price of P2P games is relatively high, and the spillover effect is low. Under such circumstances, the platform decides to provide a low-value and high-price bundled service to supplement P2P games. Moreover, when the usage cost of the bundled service is higher, HB benefits market size which also promotes digital games and reduces carbon emissions. Under such circumstances, when the unit price of P2P games is high, the platform provides a high-value and low-price service; otherwise, a low-value and low-price service. Interestingly, HB cannot simultaneously benefit both profits and market size. We find that a win–win–win situation exists for the platform, players, and social welfare when HB is profitable for the platform. When HB expands market size, it is always beneficial to players but may hurt social welfare. Finally, the bundled service may lead to social inefficiency.
{"title":"Pay-to-play versus hybrid bundling for digital game platforms in digital decarbonization era","authors":"Simeng Liu, Yashuang Wei, Guofang Nan, Dahui Li","doi":"10.1007/s10479-024-06233-9","DOIUrl":"https://doi.org/10.1007/s10479-024-06233-9","url":null,"abstract":"<p>Digital game platforms have provided “pay-to-play” (P2P) games for players to purchase and play on platforms for many years. Recently, platforms have adopted the hybrid bundling (HB) strategy that provides a bundled service of digital games in addition to P2P games. This strategy has the potential to facilitate the growth of digital games and address efficient decarbonization of physical copies of games. This study develops a theoretic model to explore whether the platform should adopt HB and, if so, what are the optimal value and price of the bundled service. We find that HB benefits profits when the usage cost of the bundled service is lower than that of P2P games, the unit price of P2P games is relatively high, and the spillover effect is low. Under such circumstances, the platform decides to provide a low-value and high-price bundled service to supplement P2P games. Moreover, when the usage cost of the bundled service is higher, HB benefits market size which also promotes digital games and reduces carbon emissions. Under such circumstances, when the unit price of P2P games is high, the platform provides a high-value and low-price service; otherwise, a low-value and low-price service. Interestingly, HB cannot simultaneously benefit both profits and market size. We find that a win–win–win situation exists for the platform, players, and social welfare when HB is profitable for the platform. When HB expands market size, it is always beneficial to players but may hurt social welfare. Finally, the bundled service may lead to social inefficiency.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"1 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251158","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}
Pub Date : 2024-09-14DOI: 10.1007/s10479-024-06241-9
Jean-François Cordeau, Manuel Iori, Dario Vezzali
The research field of Attended Home Delivery (AHD) and Attended Home Service (AHS) problems has experienced fast growing interest in the last two decades, with the rapid growth of online platforms and e-commerce transactions. The radical changes in consumer lifestyles and habits as well as the COVID-19 pandemic contingency have reinforced that interest, raising further challenges and opportunities that need to be addressed by innovative methodologies and policies. The aim of this work is to provide an extensive literature review on the state of the art for AHD and AHS problems, with a particular focus on real-world applications. A discussion of promising future research directions is also provided.
过去二十年来,随着在线平台和电子商务交易的快速增长,人们对 "上门服务"(AHD)和 "上门服务"(AHS)问题的研究兴趣与日俱增。消费者生活方式和习惯的急剧变化以及 COVID-19 大流行的突发事件加强了人们对这一问题的关注,并提出了更多的挑战和机遇,需要通过创新方法和政策加以解决。这项工作的目的是对有关 AHD 和 AHS 问题的最新研究成果进行广泛的文献综述,尤其侧重于现实世界的应用。此外,还讨论了未来有前景的研究方向。
{"title":"An updated survey of attended home delivery and service problems with a focus on applications","authors":"Jean-François Cordeau, Manuel Iori, Dario Vezzali","doi":"10.1007/s10479-024-06241-9","DOIUrl":"https://doi.org/10.1007/s10479-024-06241-9","url":null,"abstract":"<p>The research field of Attended Home Delivery (AHD) and Attended Home Service (AHS) problems has experienced fast growing interest in the last two decades, with the rapid growth of online platforms and e-commerce transactions. The radical changes in consumer lifestyles and habits as well as the COVID-19 pandemic contingency have reinforced that interest, raising further challenges and opportunities that need to be addressed by innovative methodologies and policies. The aim of this work is to provide an extensive literature review on the state of the art for AHD and AHS problems, with a particular focus on real-world applications. A discussion of promising future research directions is also provided.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"3 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251160","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}
Pub Date : 2024-09-13DOI: 10.1007/s10479-024-06253-5
Camille Grange, Michael Poss, Eric Bourreau
Noisy intermediate-scale quantum computers are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms. Among them, the Quantum Approximate Optimization Algorithm is one of the most popular one studied by the combinatorial optimization community. In this tutorial, we provide a mathematical description of the class of Variational Quantum Algorithms, assuming no previous knowledge of quantum physics from the readers. We introduce precisely the key aspects of these hybrid algorithms on the quantum side (parametrized quantum circuit) and the classical side (guiding function, optimizer). We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions. Finally, we discuss the recent literature on QAOA, highlighting several research trends.
{"title":"An introduction to variational quantum algorithms for combinatorial optimization problems","authors":"Camille Grange, Michael Poss, Eric Bourreau","doi":"10.1007/s10479-024-06253-5","DOIUrl":"https://doi.org/10.1007/s10479-024-06253-5","url":null,"abstract":"<p>Noisy intermediate-scale quantum computers are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms. Among them, the Quantum Approximate Optimization Algorithm is one of the most popular one studied by the combinatorial optimization community. In this tutorial, we provide a mathematical description of the class of Variational Quantum Algorithms, assuming no previous knowledge of quantum physics from the readers. We introduce precisely the key aspects of these hybrid algorithms on the quantum side (parametrized quantum circuit) and the classical side (guiding function, optimizer). We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions. Finally, we discuss the recent literature on QAOA, highlighting several research trends.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"5 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197662","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}
Pub Date : 2024-09-13DOI: 10.1007/s10479-024-06238-4
Jean-David Fermanian, Benjamin Poignard, Panos Xidonas
This article is written in memory of Harry Markowitz, the founder of modern portfolio theory. We report a few human perspectives of his character, we review a large number of his contributions, published both in operations research and finance oriented journals, and we focus on one of the most critical, and still open, portfolio theory issues, the forecast of covariance matrices. Our contribution in this paper is placed exactly towards this direction. More specifically, we compare the performances of several approaches to predict the variance-covariance matrices of vectors of asset returns, through simulated and real data experiments: some dynamic models such as Dynamic Conditional Correlation (DCC) and C-vine GARCH on one side, and several agnostic methods (Average Oracle, usual “Sample” matrix) on the other side. The most robust methods seem to be DCC and the Average Oracle approaches.
{"title":"Model-based vs. agnostic methods for the prediction of time-varying covariance matrices","authors":"Jean-David Fermanian, Benjamin Poignard, Panos Xidonas","doi":"10.1007/s10479-024-06238-4","DOIUrl":"https://doi.org/10.1007/s10479-024-06238-4","url":null,"abstract":"<p>This article is written in memory of Harry Markowitz, the founder of modern portfolio theory. We report a few human perspectives of his character, we review a large number of his contributions, published both in operations research and finance oriented journals, and we focus on one of the most critical, and still open, portfolio theory issues, the forecast of covariance matrices. Our contribution in this paper is placed exactly towards this direction. More specifically, we compare the performances of several approaches to predict the variance-covariance matrices of vectors of asset returns, through simulated and real data experiments: some dynamic models such as Dynamic Conditional Correlation (DCC) and C-vine GARCH on one side, and several agnostic methods (Average Oracle, usual “Sample” matrix) on the other side. The most robust methods seem to be DCC and the Average Oracle approaches.\u0000</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"14 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197665","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}
Pub Date : 2024-09-13DOI: 10.1007/s10479-024-06264-2
Péter Dobrovoczki, Tamás Kis
We present a novel algorithm for separating facet-inducing inequalities for the convex-hull of the union of polytopes representing a disjunctive constraint of special structure. It is required that the union of polytopes admit a certain network flow representation. The algorithm is based on a new, graph theoretic characterization of the facets of the convex-hull. Moreover, we characterize the family of polytopes that are representable by the networks under consideration. We demonstrate the effectiveness of our approach by computational results on a set of benchmark problems.
{"title":"Facet separation for disjunctive constraints with network flow representation","authors":"Péter Dobrovoczki, Tamás Kis","doi":"10.1007/s10479-024-06264-2","DOIUrl":"10.1007/s10479-024-06264-2","url":null,"abstract":"<div><p>We present a novel algorithm for separating facet-inducing inequalities for the convex-hull of the union of polytopes representing a disjunctive constraint of special structure. It is required that the union of polytopes admit a certain network flow representation. The algorithm is based on a new, graph theoretic characterization of the facets of the convex-hull. Moreover, we characterize the family of polytopes that are representable by the networks under consideration. We demonstrate the effectiveness of our approach by computational results on a set of benchmark problems.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"341 2-3","pages":"825 - 857"},"PeriodicalIF":4.4,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-024-06264-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197661","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}
Pub Date : 2024-09-12DOI: 10.1007/s10479-024-06250-8
Haim Levy
By the Almost First-degree Stochastic Dominance (AFSD) rule, corresponding only to economically relevant preferences, for an infinite horizon the (theoretical) claim of both Markowitz and Samuelson is not intact. However, for the practically more relevant case of the long but finite horizon, with stocks-bonds portfolios, Markowitz (empirically) is right as we find that the MGM portfolio coincides with the optimal myopic portfolio for all risk aversion parameters (alpha < 1.7). For (alpha ge 1.7) the MGM portfolio dominates by AFSD rule all optimal myopic portfolios, as long as the investment horizon is 12–15 years or longer.
{"title":"The maximum geometric mean criterion: revisiting the Markowitz–Samuelson debate: survey and analysis","authors":"Haim Levy","doi":"10.1007/s10479-024-06250-8","DOIUrl":"https://doi.org/10.1007/s10479-024-06250-8","url":null,"abstract":"<p>By the Almost First-degree Stochastic Dominance (AFSD) rule, corresponding only to <i>economically relevant</i> preferences, for an infinite horizon the <span>(theoretical)</span> claim of both Markowitz and Samuelson is not intact. However, for the practically more relevant case of the long but finite horizon, with stocks-bonds portfolios, Markowitz <span>(empirically)</span> is right as we find that the MGM portfolio coincides with the optimal myopic portfolio for all risk aversion parameters <span>(alpha < 1.7)</span>. For <span>(alpha ge 1.7)</span> the MGM portfolio dominates by AFSD rule all optimal myopic portfolios, as long as the investment horizon is 12–15 years or longer.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"41 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197664","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}
Pub Date : 2024-09-11DOI: 10.1007/s10479-024-06218-8
Yiyi Xu, M’hammed Sahnoun, Fouad Ben Abdelaziz, Anne Louis
In this paper, we introduce a new topology, connected-hubs, to the multimodal transportation literature. As strategic planning, the multimodal transportation network design decides the locations of consolidation centers and the routes between the origins and the destinations with the minimum of total cost. Most existing papers formulate the problem based on the hub-and-spoke topology, while our work is the first attempt to apply the connected-hub topology, which considers local consolidation by vehicle routing and extends some widely-used assumptions in the hub-and-spoke topology. A mathematical model is developed to formulate and solve the problem to optimality. Further, considering the problem complexity, a particle swarm optimization (PSO) algorithm is also proposed to generate efficient solutions for large-scale cases. The results of a case study in Normandy, France illustrate the efficiency and practicability of the proposed PSO in terms of economic and environmental sustainability objectives.
{"title":"Multimodal transportation network for bio-waste collection: the case of Normandy","authors":"Yiyi Xu, M’hammed Sahnoun, Fouad Ben Abdelaziz, Anne Louis","doi":"10.1007/s10479-024-06218-8","DOIUrl":"https://doi.org/10.1007/s10479-024-06218-8","url":null,"abstract":"<p>In this paper, we introduce a new topology, connected-hubs, to the multimodal transportation literature. As strategic planning, the multimodal transportation network design decides the locations of consolidation centers and the routes between the origins and the destinations with the minimum of total cost. Most existing papers formulate the problem based on the hub-and-spoke topology, while our work is the first attempt to apply the connected-hub topology, which considers local consolidation by vehicle routing and extends some widely-used assumptions in the hub-and-spoke topology. A mathematical model is developed to formulate and solve the problem to optimality. Further, considering the problem complexity, a particle swarm optimization (PSO) algorithm is also proposed to generate efficient solutions for large-scale cases. The results of a case study in Normandy, France illustrate the efficiency and practicability of the proposed PSO in terms of economic and environmental sustainability objectives.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"9 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197663","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}
Pub Date : 2024-09-10DOI: 10.1007/s10479-024-06249-1
Martin Savelsbergh, Marlin W. Ulmer
How to best deliver goods to consumers has been a logistics question since time immemorial. However, almost all traditional delivery models involved a form of company employees, whether employees of the company manufacturing the goods or whether employees of the company transporting the goods. With the growth of the gig economy, however, a new model not involving company employees has emerged: relying on crowdsourced delivery. Crowdsourced delivery involves enlisting individuals to deliver goods and interacting with these individuals using the internet. In crowdsourced delivery, the interaction with the individuals typically occurs through a platform. Importantly, the crowdsourced couriers are not employed by the platform and this has fundamentally changed the planning and execution of the delivery of goods: the delivery capacity is no longer under (full) control of the company managing the delivery. We present the challenges this introduces, review how the research community has proposed to handle some of these challenges, and elaborate on the challenges that have not yet been addressed. In this update, we expand the literature review and discuss new challenges that have emerged in the past years. (This is an updated version of the paper “Challenges and Opportunities in Crowdsourced Delivery Planning and Operations” that appeared in 4OR, 20(1), 1-21 (2022)).
自古以来,如何以最佳方式向消费者运送货物一直是一个物流问题。然而,几乎所有的传统交付模式都涉及某种形式的公司员工,无论是制造货物的公司员工,还是运输货物的公司员工。然而,随着 "打工经济 "的发展,出现了一种不涉及公司员工的新模式:依靠众包配送。众包送货涉及招募个人送货,并通过互联网与这些个人互动。在众包配送中,与个人的互动通常通过一个平台进行。重要的是,众包快递员不是由平台雇佣的,这从根本上改变了货物交付的计划和执行:交付能力不再由管理交付的公司(完全)控制。我们介绍了由此带来的挑战,回顾了研究界如何应对其中一些挑战,并详细阐述了尚未解决的挑战。在本更新中,我们将扩展文献综述,并讨论过去几年中出现的新挑战。(本文是《众包配送规划与运营中的挑战与机遇》(Challenges and Opportunities in Crowdsourced Delivery Planning and Operations)一文的更新版,该文发表于《4OR》,20(1),1-21(2022))。
{"title":"Challenges and opportunities in crowdsourced delivery planning and operations—an update","authors":"Martin Savelsbergh, Marlin W. Ulmer","doi":"10.1007/s10479-024-06249-1","DOIUrl":"https://doi.org/10.1007/s10479-024-06249-1","url":null,"abstract":"<p>How to best deliver goods to consumers has been a logistics question since time immemorial. However, almost all traditional delivery models involved a form of company employees, whether employees of the company manufacturing the goods or whether employees of the company transporting the goods. With the growth of the gig economy, however, a new model not involving company employees has emerged: relying on crowdsourced delivery. Crowdsourced delivery involves enlisting individuals to deliver goods and interacting with these individuals using the internet. In crowdsourced delivery, the interaction with the individuals typically occurs through a platform. Importantly, the crowdsourced couriers are not employed by the platform and this has fundamentally changed the planning and execution of the delivery of goods: the delivery capacity is no longer under (full) control of the company managing the delivery. We present the challenges this introduces, review how the research community has proposed to handle some of these challenges, and elaborate on the challenges that have not yet been addressed. In this update, we expand the literature review and discuss new challenges that have emerged in the past years. (This is an updated version of the paper “Challenges and Opportunities in Crowdsourced Delivery Planning and Operations” that appeared in 4OR, 20(1), 1-21 (2022)).</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"6 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142225187","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}
Pub Date : 2024-09-09DOI: 10.1007/s10479-024-06254-4
Xiufeng Li
In light of the growing consumer emphasis on delivery speed and corporate environmental responsibility, it becomes paramount to simultaneously address the alignment of customer expectations with corporate objectives. We undertake a comprehensive examination of delivery delays and carbon emissions stemming from e-commerce logistics, leading us to formulate a delivery delay penalty function informed by customer behavior traits such as loss aversion. Concurrently, we analyze various factors influencing customer satisfaction and integrate them into our model. Similarly, we incorporate multiple determinants impacting vehicle emissions, devising a logistics cost-minimization model encompassing carbon emissions and cooling expenses. By amalgamating considerations of customer satisfaction, logistics expenses, and environmental concerns, we devise a dual-objective optimization model. To tackle this complex challenge, we introduce a multi-objective Artificial Bee Colony algorithm based on MOEA/D principles, substantiating its efficacy through extensive numerical experiments. Our findings demonstrate the algorithm's ability to intelligently optimize logistics routes, thus reducing vehicle utilization. Finally, we present a Pareto front, illustrating how mitigating customer satisfaction can alleviate logistics and carbon emission costs.
{"title":"Multi-objective multi-compartment vehicle routing problem of fresh products with the promised latest delivery time","authors":"Xiufeng Li","doi":"10.1007/s10479-024-06254-4","DOIUrl":"https://doi.org/10.1007/s10479-024-06254-4","url":null,"abstract":"<p>In light of the growing consumer emphasis on delivery speed and corporate environmental responsibility, it becomes paramount to simultaneously address the alignment of customer expectations with corporate objectives. We undertake a comprehensive examination of delivery delays and carbon emissions stemming from e-commerce logistics, leading us to formulate a delivery delay penalty function informed by customer behavior traits such as loss aversion. Concurrently, we analyze various factors influencing customer satisfaction and integrate them into our model. Similarly, we incorporate multiple determinants impacting vehicle emissions, devising a logistics cost-minimization model encompassing carbon emissions and cooling expenses. By amalgamating considerations of customer satisfaction, logistics expenses, and environmental concerns, we devise a dual-objective optimization model. To tackle this complex challenge, we introduce a multi-objective Artificial Bee Colony algorithm based on MOEA/D principles, substantiating its efficacy through extensive numerical experiments. Our findings demonstrate the algorithm's ability to intelligently optimize logistics routes, thus reducing vehicle utilization. Finally, we present a Pareto front, illustrating how mitigating customer satisfaction can alleviate logistics and carbon emission costs.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"4 1","pages":""},"PeriodicalIF":4.8,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197681","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}