{"title":"Traffic service provision and pricing with consumer segmentation in online retail platform","authors":"Zheng Luo, Xu Chen","doi":"10.1016/j.ejor.2026.10.047","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.047","url":null,"abstract":"This study investigates the strategic provision of traffic services by online retail platforms operating under an agency selling model, examining the interplay between two prevalent performance-based pricing mechanisms: cost-per-click (CPC) and cost-per-action (CPA). We develop a game-theoretic framework incorporating consumer heterogeneity—segmented into exploratory and non-exploratory types—and power dynamics. Within an online retail supply chain structure, the platform selects traffic service strategies and pricing models while the supplier determines retail pricing. We analyze two distinct governance structures: an online retail platform-Stackelberg model and a generalized Nash Bargaining model on traffic service fee. We find the effect of traffic services on sales volume and consumer surplus is not uniformly positive, depending on the pricing mechanisms. Key findings reveal that traffic service provision is contingent on operational costs, with the traffic operating cost emerging as a critical implementation barrier. The choice between CPC and CPA hinges on three strategic dimensions: market-specific consumer composition (exploratory vs. non-exploratory ratios), relationship-specific bargaining power distribution, and internal platform economics (agency selling fee). CPC proves superior more in markets dominated by a low agency selling fee and online retail platform-centric power structures. Conversely, CPA outperforms in environments characterized by non-exploratory consumer majorities, high agency selling fee, and supplier-leading bargaining dynamics. Our analysis demonstrates how these factors interactively shape platform revenue models, providing insights for traffic service implementation decisions. The strategic guidance assists platforms in strategically selecting pricing mechanisms based on market conditions and operational parameters.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"37 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292197","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}
{"title":"Adaptive threshold iterated local search: An adaptive self-parameterizing algorithm for solving sports timetabling problems of the international timetabling competition 2021","authors":"Ahmad Muklason, I Gusti Agung Premananda","doi":"10.1016/j.ejor.2026.10.033","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.033","url":null,"abstract":"The International Timetabling Competition 2021 (ITC 2021) has established a rigorous benchmark for sports timetabling; however, the most effective solvers reported in the literature often rely on complex, instance-specific parameter tuning. This dependency limits their practical applicability in real-world scenarios where algorithmic expertise is limited. To address this trade-off between algorithmic performance and generality, in this study, we propose an adaptive threshold iterated local search (AT-ILS). Unlike conventional metaheuristics that utilize static cooling schedules or fixed memory lengths, AT-ILS employs a novel self-parameterizing mechanism that dynamically tunes acceptance thresholds by sampling the local solution landscape during execution. We evaluated the approach on the entire 45-instance ITC 2021 benchmark, optimizing soft-constraint penalties from precomputed feasible solutions. The experimental results demonstrate that AT-ILS achieves competitive performance without requiring the algorithmic expertise typically needed to configure sensitive parameters. Furthermore, the algorithm establishes new best-known solutions for four benchmark instances: <ce:italic>Middle 2</ce:italic> and <ce:italic>Middle 3</ce:italic>, obtained from unoptimized feasible solutions, and <ce:italic>Early 1</ce:italic> and <ce:italic>Late 11</ce:italic>, obtained by warm-starting the unmodified algorithm from the previously best-known solutions. These findings demonstrate that a self-parameterizing local search method can achieve competitive performance, offering a practical alternative to solvers that require extensive tuning.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"2 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292193","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}
Dominik Richard, Michael Morin, Claude-Guy Quimper
{"title":"Iterated local search for coverage path planning with imperfect extended detection","authors":"Dominik Richard, Michael Morin, Claude-Guy Quimper","doi":"10.1016/j.ejor.2026.10.018","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.018","url":null,"abstract":"Naval mines, many of which are remnants of past conflicts, still threaten ships, wildlife, and the environment. To detect these underwater mines, autonomous minesweepers can be used, e.g. a REMUS 100 autonomous underwater vehicle (AUV) equipped with sidescan sonars. We frame the minesweeping task as a combinatorial optimization problem called coverage path planning with imperfect extended detection (CPPIED). An efficient solution to the CPPIED minimizes both the path length and the number of turns (in that order), while satisfying stochastic coverage constraints in a grid environment. The current state of the art is a hybrid heuristic called DpSweeper. We show that, although this algorithm rapidly produces feasible solutions, the path quality is limited by its greedy nature. Since local search algorithms are known for their capacity to improve feasible solutions to large-scale combinatorial problems, such as vehicle routing problems with spatial coverage, we propose an iterated local search heuristic to enhance the solutions generated by DpSweeper. Our heuristic reduces the path length of solutions provided by DpSweeper by 9% to 28%, and the number of turns by 19% to 42%, hence improving the planning methods for minesweeping operations and bridging vehicle routing and coverage path planning problems.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"4 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292196","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}
{"title":"The undirected circular facility layout problem","authors":"Anja Fischer, Louisa Semrau","doi":"10.1016/j.ejor.2026.10.037","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.037","url":null,"abstract":"In the Undirected Circular Facility Layout Problem (UDCFLP) one has given a set of departments, their lengths and pairwise weights between the departments. The goal is to find an arrangement on a circle that minimizes the total sum of the weighted center-to-center distances, either measured in clockwise or in counter-clockwise direction, depending on which distance is shorter. Despite the advantages of circular manufacturing systems in comparison to row layout systems, the UDCFLP with arbitrary lengths has not been considered in the literature before. We present two new mixed-integer linear programming models for the UDCFLP by adapting two well-known models from well-studied facility layout problems from the literature and exploiting their connection with the UDCFLP. To strengthen our models, we study the structure of the associated polytopes. We derive different classes of cutting planes and prove their correctness. In a computational study we compare our stand-alone models and their strengthened variants regarding the deviation between their lower bounds and heuristically determined upper bounds and their computational times.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"6 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292198","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}
{"title":"Models for the assessment of partial scale characteristics in polyhedral technologies","authors":"Grammatoula Papaioannou, Victor V. Podinovski","doi":"10.1016/j.ejor.2026.10.038","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.038","url":null,"abstract":"Partial scale characteristics of efficient frontiers include the notions of partial scale efficiency, most productive scale size and returns to scale that are evaluated with respect to some selected subsets of inputs and outputs, while keeping the remaining inputs and outputs fixed. We show that, in any polyhedral technology, all such partial characteristics can be assessed by solving linear programs based on the appropriately specified partial cone extension of the technology. We obtain a general operational statement of such cone extensions and illustrate our results by an example.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"13 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292200","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}
{"title":"Pairwise comparisons meet optimal transport theory","authors":"Matteo Brunelli, Silvia Lorenzini","doi":"10.1016/j.ejor.2026.10.026","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.026","url":null,"abstract":"In this paper, we reinterpret pairwise comparison theory through the lens of optimal transport. The main contribution is the connection established between pairwise comparison matrices, doubly stochastic scaling, and entropy-regularized transport problems. Using Sinkhorn scaling, we show how consistency, priority derivation, and inconsistency assessment can be studied within a common optimal-transport framework. As methodological consequences of this connection, we obtain a new characterization of consistency, a Sinkhorn-based prioritization method, and an entropy-based inconsistency index. We study these proposals both analytically and numerically, and compare them with established methods from the literature.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"86 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292202","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}
{"title":"Competition and refurbishing strategy in closed-loop supply chains considering collection priority","authors":"Dongfeng Jia, Sijie Li","doi":"10.1016/j.ejor.2026.10.027","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.027","url":null,"abstract":"When a brand manufacturer and an independent refurbisher (IR) both refurbish and compete, this paper introduces collection priority to allocate the limited used products (cores) between them, a mechanism that couples asymmetric collection caps with asymmetric refurbishing costs. We model this competition in a closed-loop supply chain where the manufacturer supplies both new and refurbished products while the IR supplies only refurbished products, and analyze five scenarios representing different refurbisher configurations and priority regimes. Four equilibrium regions arise under each collection-priority regime, with six distinct refurbishing strategy patterns across the two regimes. Within the partial-refurbishing region analyzed, we obtain the following findings. Adding more refurbishers does not necessarily improve profitability or reduce environmental impact. Under manufacturer priority, the IR’s refurbishing-entry decision is independent of the new-product cost; under certain conditions, the priority-holding manufacturer may have a stronger incentive to refurbish alongside an active IR than alone. We also examine several extensions: the main qualitative insights largely remain robust under uncertain refurbishable yield, sequential decision making, and a two-part refurbishing-cost structure, while endogenizing the acquisition of priority reveals that competing for it is not always worthwhile; under some conditions, acquiring collection priority is payoff-irrelevant.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"17 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292199","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}
{"title":"Secretary problems with random number of candidates: How prior distributional information helps","authors":"Junhui Zhang, Patrick Jaillet","doi":"10.1016/j.ejor.2026.10.023","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.023","url":null,"abstract":"We study variants of the secretary problem, where <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>N</mml:mi></mml:math>, the number of candidates, is a random variable with distribution <mml:math altimg=\"si2.svg\" display=\"inline\"><mml:mi mathvariant=\"bold\">p</mml:mi></mml:math>. The decision maker, given prior distributional information about <mml:math altimg=\"si2.svg\" display=\"inline\"><mml:mi mathvariant=\"bold\">p</mml:mi></mml:math>, wants to maximize the probability of success – picking the largest number among the <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>N</mml:mi></mml:math> candidates – using only the sequentially revealed relative ranks of the candidates.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"74 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292203","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}
{"title":"Accepting returns from competing e-tailer: The role of selling mode","authors":"Yi Chen, Qin Su, Gang Li, Fangkezi Zhou","doi":"10.1016/j.ejor.2026.10.030","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.10.030","url":null,"abstract":"Cooperative-return-to-store (CRS) programs, where brick-and-mortar retailers (BMRs) accept returns of products sold on e-tailer platforms, are gaining traction as a strategy to boost store traffic. However, BMRs are often constrained by competitive concerns. This study examines how a competing e-tailer’s selling mode (reseller, marketplace, or dual) influences the viability of CRS for a BMR in a supply chain context. We find that the reseller (marketplace) mode is more favorable to the adoption of CRS by the BMR when the positive externalities of the store traffic are strong (weak). This distinction comes from the BMR’s varying reliance on wholesale price reductions from its supplier. We further show that the dual mode surpasses single modes in enhancing CRS agreements and social value because the e-tailer and third-party seller can share demand shifts. These findings offer actionable insights for BMR managers in partner selection and policymakers to evaluate e-commerce regulations. Our results remain robust across diverse consumer return behaviors, cost structures, decision frameworks, and CRS formats.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149292201","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}