European Journal of Operational Research最新文献

筛选
英文 中文
Solving soft and hard-clustered vehicle routing problems: A bi-population collaborative memetic search approach
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-26 DOI: 10.1016/j.ejor.2025.02.021
Yangming Zhou, Lingheng Liu, Una Benlic, Zhi-Chun Li, Qinghua Wu
{"title":"Solving soft and hard-clustered vehicle routing problems: A bi-population collaborative memetic search approach","authors":"Yangming Zhou, Lingheng Liu, Una Benlic, Zhi-Chun Li, Qinghua Wu","doi":"10.1016/j.ejor.2025.02.021","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.021","url":null,"abstract":"The soft-clustered vehicle routing problem is a natural generalization of the classic capacitated vehicle routing problem, where the routing decision must respect the already taken clustering decisions. It is a relevant routing problem with numerous practical applications, such as packages or parcels delivery. Population-based evolutionary algorithms have already been adapted to solve this problem. However, they usually evolve a single population and suffer from early convergence especially for large instances, resulting in sub-optimal solutions. To maintain a high diversity so as to avoid premature convergence, this work proposes a bi-population collaborative memetic search method that adopts a bi-population structure to balance between exploration and exploitation, where two populations are evolved in a cooperative way. Starting from an initial population generated by a data-driven and knowledge-guided population initialization, two heterogeneous memetic searches are then performed by employing a pair of complementary crossovers (i.e., a multi-route edge assembly crossover and a group matching-based crossover) to generate offspring solutions, and a bilevel variable neighborhood search to explore the solution space at both cluster and customer levels. Once the two evolved new populations are obtained, a cooperative evolution mechanism is applied to obtain a new population. Extensive experiments on 404 benchmark instances show that the proposed algorithm significantly outperforms the current state-of-the-art algorithms. In particular, the proposed algorithm discovers new upper bounds for 16 out of the 26 large-sized benchmark instances, while matching the best-known solutions for the remaining 9 large-sized instances. Ablation experiments are conducted to verify the effectiveness of each key algorithmic module. Finally, the inherent generality of the proposed method is verified by applying it to the well-known (hard) clustered vehicle routing problem.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"2 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143532976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Streamlining emergency response: A K-adaptable model and a column-and-constraint-generation algorithm
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-24 DOI: 10.1016/j.ejor.2025.02.016
Paula Weller, Fabricio Oliveira
{"title":"Streamlining emergency response: A K-adaptable model and a column-and-constraint-generation algorithm","authors":"Paula Weller, Fabricio Oliveira","doi":"10.1016/j.ejor.2025.02.016","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.016","url":null,"abstract":"Emergency response refers to the systematic response to an unexpected, disruptive occurrence such as a natural disaster. The response aims to mitigate the consequences of the occurrence by providing the affected region with the necessary supplies. A critical factor for a successful response is its timely execution, but the unpredictable nature of disasters often prevents quick reactionary measures. Preallocating the supplies before the disaster takes place allows for a faster response, but requires more overall resources because the time and place of the disaster are not yet known. This gives rise to a trade-off between how quickly a response plan is executed and how precisely it targets the affected areas. Aiming to capture the dynamics of this trade-off, we develop a <mml:math altimg=\"si345.svg\" display=\"inline\"><mml:mi>K</mml:mi></mml:math>-adjustable robust model, which allows a maximum of <mml:math altimg=\"si345.svg\" display=\"inline\"><mml:mi>K</mml:mi></mml:math> second-stage decisions, i.e., response plans. This mitigates tractability issues and allows the decision-maker to seamlessly navigate the gap between the readiness of a proactive yet rigid response and the accuracy of a reactive yet highly adjustable one. The approaches we consider to solve the <mml:math altimg=\"si345.svg\" display=\"inline\"><mml:mi>K</mml:mi></mml:math>-adaptable model are twofold: Via a branch-and-bound method as well as a static robust reformulation in combination with a column-and-constraint generation algorithm. In a computational study, we compare and contrast the different solution approaches and assess their potential.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143532975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Can blockchain implementation combat food fraud: Considering consumers’ delayed quality perceptions
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-21 DOI: 10.1016/j.ejor.2025.02.028
Deqing Ma, Xueping Wu, Kaifu Li, Jinsong Hu
{"title":"Can blockchain implementation combat food fraud: Considering consumers’ delayed quality perceptions","authors":"Deqing Ma, Xueping Wu, Kaifu Li, Jinsong Hu","doi":"10.1016/j.ejor.2025.02.028","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.028","url":null,"abstract":"Food fraud is driven by unethical enterprises’ economic incentives and endures due to consumers’ delayed quality perceptions, while present solutions make it impossible for ethical firms to verify food quality in a timely and convincing manner. To that end, this paper focuses on a duopoly competition between an ethical firm (H) and an unethical firm (L) incorporating consumers’ delayed quality perceptions. Considering the industry credibility crisis that food fraud may trigger, we analytically explore the conditions and effects of firm H to combat food fraud with the aid of blockchain technology (BCT). Counterintuitively, this paper finds that quality improvements beyond industry standards are not always beneficial to firms. Indeed, firms H and L will adopt quality improvements only when marginal returns are higher or delayed perceived time of quality (DPTQ) is longer, respectively. When deciding whether to adopt BCT, H should consider not only the implementation cost and DPTQ, but also the non-monotonic impact of DPTQ on the cost threshold. In addition, it is found that the application of BCT will always motivate H to make quality improvements and further enhance the goodwill, demand, and profits, but that the effect of combating food fraud is stage-specific. Within DPTQ, BCT will only serve as a marketing tool to enhance the competitiveness of H. It is outside of DPTQ that BCT can be effective in combating food fraud, not only by accelerating L's exit from the market, but also by increasing H's market share at the same time.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"29 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143532973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Product design and pricing decisions in platform-based co-creation
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-20 DOI: 10.1016/j.ejor.2025.02.015
Siyuan Zhu, Tengfei Nie, Jianghua Zhang, Shaofu Du
{"title":"Product design and pricing decisions in platform-based co-creation","authors":"Siyuan Zhu, Tengfei Nie, Jianghua Zhang, Shaofu Du","doi":"10.1016/j.ejor.2025.02.015","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.015","url":null,"abstract":"Co-creation, a new business model that requires platform enterprises, manufacturers, and even consumers to participate in product research and development, has become increasingly popular in recent years. Simultaneously, technological advances in platforms have provided a convenient channel for consumers to contribute creative ideas in co-creation activities, providing an opportunity to rebuild business models. In this study, we consider a setting where a platform enterprise, a manufacturer, and a group of consumers jointly design and produce a co-created product. We focus on how a platform impacts co-creation. In the co-creation process, the platform integrates the consumers’ ideas and chooses a product innovation design (i.e., either an aesthetic-oriented or a functionality-oriented product design), after which the manufacturer sells the co-created product in a heterogeneous market. We demonstrate that each type of product innovation design has its own scope of application, and neither is strictly dominant. We find that when the product value exerted by consumers is higher than a certain threshold, a lose-lose situation may occur for the profits of the platform and manufacturer. Furthermore, we endogenize the consumers’ effort decisions in co-creation and find that each type of product innovation design can still be the equilibrium strategy.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"50 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-objective cooperative co-evolution algorithm with hypervolume-based Q-learning for hybrid seru system
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-19 DOI: 10.1016/j.ejor.2025.02.025
Zhecong Zhang, Yang Yu, Xuqiang Qi, Yangguang Lu, Xiaolong Li, Ikou Kaku
{"title":"Multi-objective cooperative co-evolution algorithm with hypervolume-based Q-learning for hybrid seru system","authors":"Zhecong Zhang, Yang Yu, Xuqiang Qi, Yangguang Lu, Xiaolong Li, Ikou Kaku","doi":"10.1016/j.ejor.2025.02.025","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.025","url":null,"abstract":"The hybrid <ce:italic>seru</ce:italic> system (HSS), which is an innovative production pattern that emerges from real-world production situations, is practical because it includes both <ce:italic>serus</ce:italic> and a flow line, allowing temporary workers who are unable to complete all tasks to be assigned to the flow line<ce:italic>.</ce:italic> We focus on the HSS by minimising both makespan and total labour time. The HSS includes two complicated coupled NP-hard subproblems: hybrid <ce:italic>seru</ce:italic> formation and hybrid <ce:italic>seru</ce:italic> scheduling. Thus, we developed a multi-objective cooperative co-evolution algorithm with hypervolume-based Q-learning (MOCC<ce:glyph name=\"sbnd\"></ce:glyph>HVQL) involving hybrid <ce:italic>seru</ce:italic> formation and scheduling subpopulations, evolved using a genetic algorithm. To achieve balance between exploration and exploitation, a hypervolume-based Q-learning mechanism is proposed to adaptively adjust the number of non-dominated hybrid <ce:italic>seru</ce:italic> formations/scheduling in co-evolution. To reduce computational time and enhance population diversity, a population partitioning mechanism is proposed. Extensive comparative results demonstrate that the MOCC<ce:glyph name=\"sbnd\"></ce:glyph>HVQL outperforms state-of-the-art algorithms in terms of solution convergence and diversity, with the hypervolume metric increasing by 22 % and inverse generational distance metric decreasing by 76 %. Compared with a pure <ce:italic>seru</ce:italic> system (PSS), the HSS can significantly reduce training tasks, thereby conserving the training budget. In scenarios with fewer workers and more batches, a positive phenomenon, where the HSS significantly decreases the training tasks relative to PSS while only slightly increasing the makespan, was observed. In specific instances, the HSS reduced the number of training tasks by 50 %, while only increasing the makespan by 10.5 %.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"12 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143532977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Prelim p. 2; First issue - Editorial Board 预览第 2 页;第一期 - 编辑委员会
IF 6 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-18 DOI: 10.1016/S0377-2217(25)00122-5
{"title":"Prelim p. 2; First issue - Editorial Board","authors":"","doi":"10.1016/S0377-2217(25)00122-5","DOIUrl":"10.1016/S0377-2217(25)00122-5","url":null,"abstract":"","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"323 1","pages":"Page ii"},"PeriodicalIF":6.0,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143436775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Integer linear programming formulations for the maximum flow blocker problem
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-17 DOI: 10.1016/j.ejor.2025.02.013
Isma Bentoumi, Fabio Furini, A. Ridha Mahjoub, Sébastien Martin
{"title":"Integer linear programming formulations for the maximum flow blocker problem","authors":"Isma Bentoumi, Fabio Furini, A. Ridha Mahjoub, Sébastien Martin","doi":"10.1016/j.ejor.2025.02.013","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.013","url":null,"abstract":"Given a network with capacities and blocker costs associated with its arcs, we study the maximum flow blocker problem (FB). This problem seeks to identify a minimum-cost subset of arcs to be removed from the network, ensuring that the maximum flow value from the source to the destination in the remaining network does not exceed a specified threshold. The FB finds applications in telecommunication networks and monitoring of civil infrastructures, among other domains. We undertake a comprehensive study of several new integer linear programming (ILP) formulations designed for the FB. The first type of model, featuring an exponential number of constraints, is solved through tailored Branch-and-Cut algorithms. In contrast, the second type of ILP model, with a polynomial number of variables and constraints, is solved using a state-of-the-art ILP solver. The latter formulation establishes a structural connection between the FB and the maximum flow interdiction problem (FI), introducing a novel approach to obtaining solutions for each problem from the other. The ILP formulations proposed for solving the FB are evaluated thanks to a theoretical analysis assessing the strength of their LP relaxations. Additionally, the exact methods presented in this paper undergo a thorough comparison through an extensive computational campaign involving a set of real-world and synthetic instances. Our tests aim to evaluate the performance of the exact algorithms and identify the features of instances that can be solved with proven optimality.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"9 371 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143532974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
It’s All in the Mix: Technology choice between driverless and human-driven vehicles in sharing systems
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-17 DOI: 10.1016/j.ejor.2025.02.004
Layla Martin, Stefan Minner, Marco Pavone, Maximilian Schiffer
{"title":"It’s All in the Mix: Technology choice between driverless and human-driven vehicles in sharing systems","authors":"Layla Martin, Stefan Minner, Marco Pavone, Maximilian Schiffer","doi":"10.1016/j.ejor.2025.02.004","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.004","url":null,"abstract":"Operators of vehicle-sharing systems such as carsharing or ride-hailing can benefit from integrating driverless vehicles into their fleet. In this context, we study the impact of optimal fleet size and composition on an operator’s profitability, which entails a non-trivial tradeoff between operational benefits and higher upfront investment for driverless vehicles.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"28 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Structural feedback and behavioral decision making in queuing systems: A hybrid simulation framework
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-15 DOI: 10.1016/j.ejor.2025.02.010
Sergey Naumov, Rogelio Oliva
{"title":"Structural feedback and behavioral decision making in queuing systems: A hybrid simulation framework","authors":"Sergey Naumov, Rogelio Oliva","doi":"10.1016/j.ejor.2025.02.010","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.010","url":null,"abstract":"Traditional queuing models mostly leave human judgment and decision making outside the scope of the system, ignoring their role as determinants of system performance. However, empirical evidence has shown that human behavior can substantially alter the system’s output. In this paper, we develop a hybrid approach that improves our understanding of the interplay between individual heterogeneous human agents and aggregate system behavior. We formulate human behavioral responses as feedback control processes, explicitly capturing the agent’s objectives and available information about the system’s state, accounting for delays and possible distortions. Our modeling approach taps into a behavioral modeling tradition that values realism and representativeness, making the formulations flexible and easily adaptable to specific situations. We illustrate our approach by considering a queuing system with delay announcement, commonly found in service and manufacturing settings. We find that the system continuously cycles between periods of low and high utilization, creating a suboptimal mode with predictable periods of high and low congestion and fewer customers served overall. By structuring the effect of behavioral responses as feedback loops, we formally analyze the observed system behavior and map it to behavioral decisions. The proposed modeling and analysis framework can guide system design and improve performance in scenarios where key dynamics are driven by both feedback structure and stochasticity. It provides generalizable structural explanations of the impact of human behavior in queuing systems.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"20 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Maximum-expectation matching under recourse
IF 6.4 2区 管理学
European Journal of Operational Research Pub Date : 2025-02-15 DOI: 10.1016/j.ejor.2025.02.012
João Pedro Pedroso, Shiro Ikeda
{"title":"Maximum-expectation matching under recourse","authors":"João Pedro Pedroso, Shiro Ikeda","doi":"10.1016/j.ejor.2025.02.012","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.02.012","url":null,"abstract":"This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that the solution is built in several steps. In a given step, edges with successfully matched vertices are made permanent; but upon edge or vertex failures, the remaining vertices become eligible for reassignment. This process may be repeated a given number of times, and the objective is to end with the overall maximum number of matched vertices.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"70 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信