European Journal of Operational Research 2023年第307卷第1期论文目录

Title:Prelim p. 2; First issue - Editorial Board
Title:初步p. 2;第一期-编辑部
Author:Date:
DOI:https://doi.org/10.1016/S0377-2217(23)00020-6
Abstract:
Abstract:
Highlights:

------- Paper (1/32) -------
Title:A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem
Title:多技能资源约束项目调度问题的分类和新的基准实例
Author:Jakob Snauwaert a
Mario Vanhoucke abc
a: Faculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, Ghent 9000, Belgium
b: Operations and Technology Management Centre, Vlerick Business School, Reep 1, Ghent 9000, Belgium
c: UCL School of Management, University College London, 1 Canada Square, London E14 5AA, UK
Date:Received 31 May 2021, Accepted 30 May 2022, Available online 8 June 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.05.049
Abstract:Abstract This paper studies and analyses the multi-skilled resource-constrained project scheduling problem (MSRCPSP). We present a new classification scheme based on an existing classification scheme for project scheduling problems. This allows researchers to classify all multi-skilled project scheduling problems and its extensions. Furthermore, we propose a new data generation procedure for the MSRCPSP and introduce multiple artificial datasets for varying research purposes. The new datasets are generated based on new multi-skilled resource parameters and are compared to existing benchmark datasets in the literature. A set of 7 empirical multi-skilled project instances from software and railway construction companies are collected in order to validate the quality of the artificial datasets. Solutions are obtained through a genetic algorithm and by solving a mixed-integer linear programming formulation with CPLEX 12.6. The hardness of the multi-skilled project instances is investigated in the computational experiments. An experimental analysis studies the impact of skill availability, workforce size and multi-skilling on the makespan of the project.
Abstract:研究和分析了多技能资源约束项目调度问题(MSRCPSP)。在现有项目调度问题分类方案的基础上，提出了一种新的分类方案。这使得研究人员能够对所有多技能项目调度问题及其扩展进行分类。此外，我们为MSRCPSP提出了一种新的数据生成程序，并为不同的研究目的引入了多个人工数据集。新的数据集是基于新的多技能资源参数生成的，并与文献中现有的基准数据集进行比较。为了验证人工数据集的质量，收集了7个来自软件和铁路建设公司的经验多技能项目实例。通过遗传算法和CPLEX 12.6混合整数线性规划公式求解得到了解。通过计算实验研究了多技能工程实例的硬度。一项实验分析研究了技能可用性、劳动力规模和多技能对项目工期的影响。
Highlights:Highlights • We propose a new classification scheme for multi-skilled resource-constrained project scheduling problems. • New multi-skilled resource parameters are introduced to define multi-skilled resources in projects. • Several datasets are presented that fit a wide range of research requirements in the field of multi-skilled project scheduling. These sets are made available on our website. • The generated data is compared to benchmark datasets of the literature. • Computational experiments are provided in which the dataset is evaluated based on the multi-skilled resource parameters.

------- Paper (2/32) -------
Title:On designing networks resilient to clique blockers
Title:关于设计能够抵御小集团阻碍的网络
Author:Haonan Zhong a
Foad Mahdavi Pajouh b
Oleg A． Prokopyev c
a: Mechanical Engineering Department, City College, Kunming University of Science and Technology, Xishan, Kunming 650032, China
b: School of Business, Stevens Institute of Technology, 1 Castle Point Terrace, Hoboken, NJ 07030, USA
c: Department of Industrial Engineering, University of Pittsburgh, 3700 O’Hara Street, Pittsburgh, PA 15261, USA
Date:Received 19 January 2022, Accepted 13 September 2022, Available online 19 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.013
Abstract:Abstract Robustness and vulnerability analysis of networked systems is often performed using the concept of vertex blockers. In particular, in the minimum cost vertex blocker clique problem, we seek a subset of vertices with the minimum total blocking cost such that the weight of any remaining clique in the interdicted graph (after the vertices are blocked) is upper bounded by some pre-defined parameter. Loosely speaking, we aim at disrupting the network with the minimum possible cost in order to guarantee that the network does not contain cohesive (e.g., closely related) groups of its structural elements with large weights; such groups are modeled as weighted cliques. In this paper, our focus is on designing networks that are resilient to clique blockers. Specifically, we construct additional connections (edges) in the network and our goal is to ensure (at the minimum possible cost of newly added edges) that the adversarial decision-maker (or the worst-case realization of random failures) cannot disrupt the network (namely, the weight of its cohesive groups) at some sufficiently low cost. The proposed approach is useful for modeling effective formation and preservation of influential clusters in networked systems. We first explore structural properties of our problem. Then, we develop several exact solution schemes based on integer programming and combinatorial branch-and-bound techniques. Finally, the performance of our approaches is explored in a computational study with randomly-generated and real-life network instances.
Abstract:摘要网络系统的鲁棒性和脆弱性分析通常使用顶点阻塞器的概念进行。特别地，在最小代价顶点阻塞器团问题中，我们寻找具有最小总阻塞代价的顶点子集，使得被阻断图中任何剩余团的权值(在顶点被阻塞后)由某个预定义的参数上界。松散地说，我们的目标是以尽可能小的代价破坏网络，以保证网络不包含具有大权重的结构元素的内聚(例如，密切相关的)组;这样的群体被建模为加权集团。在这篇论文中，我们的重点是设计对派系阻塞有弹性的网络。具体来说，我们在网络中构建额外的连接(边)，我们的目标是确保(以新添加边的最小可能代价)对抗决策者(或随机故障的最坏情况实现)不能以足够低的代价破坏网络(即其内聚组的权重)。所提出的方法对于网络系统中有影响力的集群的有效形成和保存建模是有用的。我们首先探讨问题的结构性质。然后，基于整数规划和组合分支定界技术，给出了几种精确解方案。最后，在随机生成和现实网络实例的计算研究中探索了我们方法的性能。
Highlights:

------- Paper (3/32) -------
Title:Dynamically second-preferred -center problem
Title:动态第二优先中心问题
Author:Yolanda Hinojosa ab
Alfredo Marín d
Justo Puerto ac
a: Instituto de Matemáticas, Universidad de Sevilla (IMUS). Edificio Celestino Mutis, Avda. Reina Mercedes s/n, Sevilla 41012, Spain
b: Dpto. de Economía Aplicada I, Universidad de Sevilla. Fac. de C. Económicas y Empresariales, Avda. Ramón y Cajal 1, Sevilla 41018, Spain
c: Dpto. de Estadística e Investigación Operativa, Universidad de Sevilla. Fac. de Matemáticas, Avda. Reina Mercedes s/n, Sevilla 41012, Spain
d: Dpto. de Estadística e Investigación Operativa, Universidad de Murcia. Fac. de Matemáticas, Campus de Espinardo, Murcia 30100, Spain
Date:Received 14 October 2021, Accepted 20 September 2022, Available online 24 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.019
Abstract:Abstract This paper deals with the Dynamically Second-preferred p p -center Problem (DSpP). In this problem, customers’ preferences and subsets of sites that each customer is willing to accept as service centers are taken into account. It is assumed that centers can fail and, thus, the decision maker is risk-averse and makes his decision taking into account not only the most favourite centers of the customers but also the worst case situation whenever they evaluate their preferred second opportunity. Specifically, the new problem aims at choosing at most p p centers so that each demand point can visit at least two acceptable centers and the maximum sum of distances from any demand point to any of its preferred centers plus the distance from any of the preferred centers to any of the centers the user prefers once he is there is minimized. The problem is NP-hard as an extension of the p p -next center problem. The paper presents three different mixed-integer linear programming formulations that are valid for the problem. Each formulation uses different space of variables giving rise to some strengthening using valid inequalities and variable fixing criteria that can be applied when valid upper bounds are available. Exact methods are limited so that a heuristic algorithm is also developed to provide good quality solution for large size instances. Finally, an extensive computational experience has been performed to assess the usefulness of the formulations to solve DSpP using standard MIP solvers.
Abstract:本文讨论了动态二阶优先p< math>p -center问题(DSpP)。在这个问题中，考虑了客户的偏好和每个客户愿意接受作为服务中心的站点子集。假设中心可能会失败，因此，决策者是风险厌恶的，他的决策不仅考虑到客户最喜欢的中心，而且在他们评估他们首选的第二次机会时，也考虑到最坏的情况。具体来说，新问题的目的是选择最多p< math>p中心，以便每个需求点可以访问至少两个可接受的中心，并且从任何需求点到其任何首选中心的距离加上从任何首选中心到用户首选的任何中心的距离的最大和最小化。这个问题是np难的，作为p< math>p -next center问题的扩展。本文给出了三种不同的混合整数线性规划公式，分别适用于该问题。每个公式使用不同的变量空间，从而使用有效的不等式和变量固定标准进行一些强化，当有效的上界可用时，可以应用这些标准。由于方法的局限性，本文还开发了一种启发式算法，为大型实例提供高质量的解决方案。最后，进行了广泛的计算经验，以评估使用标准MIP求解器求解DSpP公式的有用性。
Highlights:Highlights • An extension of the next p-center problem with customers’ preferences. • Facility reliability in combination with customers’ preferences. • Three mixed-integer linear formulations: three-indexed, straight and radius. • Valid inequalities and variable fixing criteria provided. • Heuristic algorithm provided.

------- Paper (4/32) -------
Title:Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
Title:具有随机行程和服务时间的家庭服务路线和预约调度问题的随机优化模型
Author:Man Yiu Tsang
Karmel S. Shehadeh
Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA
Date:Received 18 November 2021, Accepted 20 September 2022, Available online 24 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.020
Abstract:Abstract We address a routing and appointment scheduling problem with uncertain service and travel times arising from home service practice. Specifically, given a set of customers within a service region that an operator needs to serve, we seek to find the operator’s route and time schedule. The quality of routing and scheduling decisions is a function of the total operational cost, consisting of customers’ waiting time, and the operator’s travel time, idle time and overtime. We propose and rigorously analyze a stochastic programming model and two distributionally robust optimization (DRO) models to solve the problem, assuming known and unknown service and travel time distributions, respectively. We consider two popular types of ambiguity sets for the DRO models: mean-support and 1-Wasserstein ambiguity sets. We derive equivalent mixed-integer linear programming (MILP) reformulations of both DRO models that can be implemented and efficiently solved using off-the-shelf optimization software, thereby enabling practitioners to use these models. In an extensive numerical experiment, we investigate the proposed models’ computational and operational performance and derive insights into the problem.
Abstract:摘要针对家庭服务实践中出现的服务和出行时间不确定的路由和预约调度问题。具体来说，给定运营商需要服务的服务区域内的一组客户，我们寻求运营商的路线和时间计划。路由和调度决策的质量是总运营成本的函数，包括客户的等待时间、运营商的旅行时间、空闲时间和加班时间。我们提出并严格分析了一个随机规划模型和两个分布鲁棒优化(DRO)模型来解决问题，分别假设已知和未知的服务和旅行时间分布。我们考虑了DRO模型的两种流行的模糊集:均值支持和1-Wasserstein模糊集。我们推导了两个DRO模型的等效混合整数线性规划(MILP)重新公式，可以使用现成的优化软件实现并有效求解，从而使从业者能够使用这些模型。在广泛的数值实验中，我们研究了所提出的模型的计算和操作性能，并得出了对问题的见解。
Highlights:

------- Paper (5/32) -------
Title:A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs
Title:混合图上具有不规则服务的农村邮差周期问题的两阶段混合算法
Author:Enrique Benavent a
Ángel Corberán a
Demetrio Laganà b
Francesca Vocaturo c
a: Departament d’Estadística i Investigació Operativa (DEIO), Universitat de València, Dr. Moliner 50, Burjassot 46100, Valencia, Spain
b: Dipartimento di Ingegneria Meccanica, Energetica e Gestionale (DIMEG), Università della Calabria, via Pietro Bucci Cubo 41/C, Arcavacata di Rende (CS) 87036, Italy
c: Dipartimento di Economia, Statistica e Finanza “Giovanni Anania” (DESF), Università della Calabria, via Pietro Bucci Cubo 0/C, Arcavacata di Rende (CS) 87036, Italy
Date:Received 7 December 2021, Accepted 21 September 2022, Available online 26 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.026
Abstract:Abstract In this article we address the periodic rural postman problem with irregular services ( PRPP–IS ), where some arcs and/or edges of a mixed graph must be traversed (to be serviced) a certain number of times in some subsets of days of a given time horizon. The goal is to define a set of minimum cost tours, one for each day or period of the time horizon, that satisfy the service requirements. For this problem we propose a two-phase algorithm that combines heuristics and mathematical programming. In the first phase, two different procedures are used to construct feasible solutions: a multi-start heuristic based on feasibility pump and a multi-start constructive heuristic. From these solutions, some fragments (parts of tours associated with the different days) are extracted. The second phase determines a solution for the PRPP–IS by combining the fragments by means of a mathematical model. We show the effectiveness of this solution approach through an extensive experimental phase on different sets of instances.
Abstract:摘要在本文中,我们解决周期性的乡村邮递员问题与不规则的服务(PRPP–IS),一些弧线和/或混合图的边缘必须遍历(服务)一定数量的次一些天的给定时间范围的子集。目标是确定一组最低费用旅行，每天一次或时间段一次，以满足服务需求。针对这一问题，我们提出了一种结合启发式和数学规划的两阶段算法。在第一阶段，采用两种不同的方法构造可行解:基于可行性泵的多起点启发式方法和多起点构造启发式方法。从这些解决方案中，提取出一些片段(与不同日期相关的旅游部分)。第二阶段确定了PRPP–IS 的解决方案。我们通过在不同实例集上的广泛实验阶段展示了这种解决方法的有效性。
Highlights:

------- Paper (6/32) -------
Title:Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
Title:基于约束最短路径模型的鲁棒串行批与并行批调度问题的精确算法
Author:Wei Wu a
Takito Hayashi a
Kato Haruyasu b
Liang Tang c
a: Graduate School of Integrated Science and Technology, Shizuoka University, 3-5-1 Johoku, Naka-ku, Hamamatsu, Shizuoka, 432-8561, Japan
b: Faculty of Science and Technology, Seikei University, 3-3-1 Kita-machi, Kichijoji, Musashino, Tokyo, 180-8633, Japan
c: College of Transportation Engineering, Dalian Maritime University, No.1 Linghai Road, Dalian, 116026, China
Date:Received 22 November 2021, Accepted 25 September 2022, Available online 29 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.032
Abstract:Abstract We study robust single-machine batch scheduling problems under uncertain processing times to minimize total flow time. Two types of batches are considered: serial batch (s-batch) and parallel batch (p-batch). These problems can model many on-site production and logistics applications which involve uncertain factors such as defect rates. We first prove that a sequencing rule for the shortest nominal processing time is optimal for both s-batch and p-batch problems. We then propose polynomial-time algorithms based on the observation that the robust batch scheduling problems are reducible or partially reducible to a constrained shortest path problem through worst-case scenario analysis. We further present more efficient algorithms for the special case of uniform maximum deviation times for all jobs. The algorithms are evaluated computationally, and the results show that their performance is satisfactory on the tested instances.
Abstract:摘要研究了在不确定加工时间下，最小化总流程时间的单机批量鲁棒调度问题。考虑两种类型的批:串行批(s批)和并行批(p批)。这些问题可以模拟许多现场生产和物流应用，其中涉及不确定因素，如不良率。我们首先证明了对于s批和p批问题，最短名义处理时间的排序规则是最优的。然后，我们通过最坏情况分析，观察到鲁棒批调度问题可约约或部分约约为约束最短路径问题，并提出多项式时间算法。对于所有作业的最大偏差时间都相同的特殊情况，我们进一步提出了更有效的算法。对算法进行了计算评估，并通过实例验证了算法的性能。
Highlights:

------- Paper (7/32) -------
Title:Are price matching and logistics service enhancement always effective strategies for improving profitability?
Title:价格匹配和物流服务提升总是提高盈利能力的有效策略吗?
Author:Jie Wei
Meijing Chang
School of economics and management, Hebei University of Technology, Tianjin 300401, China
Date:Received 6 October 2021, Accepted 18 August 2022, Available online 24 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.025
Abstract:Abstract Driven by increasingly fierce market competition, many traditional retailers have started to adopt price matching under which they promise to match competitors’ lower prices for the same product, and many online retailers have started to conduct logistics service enhancement. Motivated by these observations, we use the Hotelling model to develop a duopoly game, in which a traditional retailer and an online retailer sell the same product to consumers, to examine the effectiveness of price matching and logistics service enhancement in improving profitability. The results show that in the scenario where the online retailer does not conduct logistics service enhancement, the traditional retailer benefits from price matching only when the transportation cost to the brick-and-mortar store is high. However, in the scenario where the online retailer conducts logistics service enhancement, when the transportation cost is relatively low, the traditional retailer also has a chance to benefit from price matching. In contrast, regardless of the traditional retailer’s price matching strategy, the online retailer always benefits from logistics service enhancement. We also reveal that regardless of the online retailer’s logistics service enhancement strategy, the traditional retailer’s price matching can lead to Pareto improvement for both retailers as long as the transportation cost is high enough. However, only when the traditional retailer adopts price matching does the online retailer’s logistics service enhancement have a chance to lead to Pareto improvement for both retailers.
Abstract:在日益激烈的市场竞争的推动下，许多传统零售商开始采取价格匹配的方式，承诺在同一产品上与竞争对手的较低价格相匹配，许多网络零售商开始进行物流服务提升。在这些观察的激励下，我们使用霍特林模型开发了一个双寡头博弈，在这个博弈中，传统零售商和在线零售商向消费者销售相同的产品，以检验价格匹配和物流服务增强在提高盈利能力方面的有效性。研究结果表明，在网络零售商不进行物流服务提升的情况下，传统零售商只有在到达实体店的运输成本较高时才能从价格匹配中获益。但是，在网络零售商进行物流服务提升的场景下，当运输成本相对较低时，传统零售商也有机会从价格匹配中获益。相比之下，无论传统零售商的价格匹配策略如何，在线零售商始终受益于物流服务的提高。我们还发现，无论网络零售商的物流服务提升策略如何，只要运输成本足够高，传统零售商的价格匹配都可以使双方零售商的帕累托改善。然而，只有当传统零售商采用价格匹配时，网络零售商的物流服务提升才有可能导致双方的帕累托改善。
Highlights:

------- Paper (8/32) -------
Title:A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
Title:凹成本二产品容量批量问题的动态规划方法
Author:Kevin A. Bunn
José A. Ventura
Harold and Inge Marcus Department of Industrial and Manufacturing Engineering, Pennsylvania State University, University Park, PA, 16802, USA
Date:Received 29 June 2021, Accepted 18 August 2022, Available online 24 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.026
Abstract:Abstract In this paper, we analyze a two-product multi-period dynamic lot-sizing problem with a fixed capacity constraint in each period. Each product has a known demand in each period that must be satisfied over a finite planning horizon. The aim of this problem is to minimize the overall cost of placing orders and carrying inventory across all periods. The structure of an optimal solution is analyzed with respect to a type of period called regeneration period, which is a period where the inventory of one or both products reach zero. We show that there is an optimal arrangement of placing orders between consecutive regeneration periods. We propose a pseudo-polynomial algorithm to solve the two-product problem. First, we show how the optimal ordering pattern between two consecutive regeneration periods can be solved using a shortest path problem. Then, we explain how the optimal locations for regeneration periods can be found by solving a shortest path problem on a different network, where each arc corresponds to the shortest path in a subproblem network. We then show how this approach can be scaled up to a three-product problem and generalize this technique to any number of products, as long as it is small.
Abstract:摘要本文分析了具有固定产能约束的两积多周期动态批量生产问题。每个产品在每个时期都有一个已知的需求，必须在有限的规划范围内得到满足。这个问题的目的是最小化所有时期下订单和持有库存的总成本。最优解的结构是根据一种称为再生期的时期来分析的，再生期是一种或两种产品的库存都为零的时期。我们证明了在连续的再生周期之间有一个最优的订货安排。我们提出了一个伪多项式算法来解决二积问题。首先，我们展示了如何使用最短路径问题来解决两个连续再生周期之间的最优排序模式。然后，我们解释了如何通过解决不同网络上的最短路径问题来找到再生周期的最佳位置，其中每个弧对应于子问题网络中的最短路径。然后，我们将展示如何将这种方法扩展到三种产品的问题，并将这种技术推广到任何数量的产品，只要它很小。
Highlights:

------- Paper (9/32) -------
Title:Inventory allocation with full downward substitution and monotone cost differences
Title:完全向下替代和单调成本差异的库存分配
Author:Yulia Tseytlin a
H. Sebastian Heese b
a: EBS University, Institute for Supply Chain Management, Burgstrasse 5, Oestrich-Winkel 65375, Germany
b: Poole College of Management, NC State University, Raleigh, NC 27695-7229, USA
Date:Received 8 June 2021, Accepted 19 August 2022, Available online 24 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.027
Abstract:Abstract We study a single-period multi-product inventory allocation problem with full downward substitution and monotone cost differences. The cost structure with monotone differences is more general than the additive cost structure usually assumed in literature. Using the notion of Monge sequences, we identify conditions under which the problem can be solved efficiently using greedy allocation. For problems that do not meet these conditions, we develop an efficient algorithm that solves the problem to optimality. For this specific problem, our algorithm has substantially lower computational complexity than existing efficient algorithms for the more general transportation problem; we numerically confirm this superior computational efficiency and illustrate the importance of using efficient algorithms at the allocation stage of the inventory management problem.
Abstract:研究了具有完全向下替代和单调成本差异的单期多产品库存分配问题。具有单调差异的成本结构比文献中通常假设的加性成本结构更具有普遍性。利用蒙格序列的概念，我们确定了使用贪婪分配可以有效解决问题的条件。对于不满足这些条件的问题，我们开发了一个有效的算法来解决问题的最优性。对于这个特定的问题，我们的算法的计算复杂度大大低于现有的更一般的运输问题的有效算法;我们从数值上证实了这种卓越的计算效率，并说明了在库存管理问题的分配阶段使用高效算法的重要性。
Highlights:

------- Paper (10/32) -------
Title:Community logistics and dynamic community partitioning: A new approach for solving e-commerce last mile delivery
Title:社区物流与动态社区划分:解决电子商务最后一英里配送的新方法
Author:Zhiyuan Ouyang a
Eric K.H. Leung b
George Q. Huang a
a: Department of Industrial and Manufacturing Systems Engineering, The University of Hong Kong, Pokfulam, Hong Kong
b: Management School, University of Liverpool, Liverpool, United Kingdom
Date:Received 14 October 2021, Accepted 23 August 2022, Available online 28 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.029
Abstract:Abstract Last mile delivery shows an increasingly tough challenge for logistics service providers due to the rapidly expanding e-commerce sales around the globe. To ease the implementation of last mile delivery, an effective delivery strategy is to predetermine the service regions of vehicles before optimizing their delivery routes. On this ground, this paper proposes a new delivery strategy named Community Logistics (CL) to generate vehicle service region and departure time dynamically. Through adopting this new delivery strategy, we transform the original last mile delivery to a new type of research problem, namely dynamic community partitioning problem (DCPP), with an aim to strike a balance between vehicle service region range, order delay time and vehicle capacity usage based on the real-time order arrivals and vehicle availability status. We present a Markov decision process (MDP) model for the DCPP and develop a heuristic solution approach to solve this MDP model. Numerical results demonstrate significant benefits of the proposed solution framework and delivery strategy.
Abstract:随着电子商务销售在全球范围内的迅速发展，最后一英里配送对物流服务提供商来说是一个日益严峻的挑战。为了便于最后一英里配送的实施，有效的配送策略是在优化配送路线之前，预先确定车辆的服务区域。在此基础上，提出了一种动态生成车辆服务区域和出发时间的社区物流配送策略。通过采用这种新的配送策略，我们将原来的最后一英里配送转化为一种新型的研究问题，即动态社区划分问题(DCPP)，目的是在实时订单到达和车辆可用状态的基础上，在车辆服务区域范围、订单延迟时间和车辆容量使用之间取得平衡。我们提出了一个用于DCPP的马尔可夫决策过程(MDP)模型，并开发了一种启发式求解方法来求解该MDP模型。数值结果表明了所提出的解决方案框架和交付策略的显著优势。
Highlights:

------- Paper (11/32) -------
Title:Cargo securing under multi-drop and axle weight constraints
Title:多滴和轴重约束下的货物固定
Author:Hatice Çalık a
Marc Juwet b
Hande Yaman c
Greet Vanden Berghe a
a: KU Leuven, Department of Computer Science, CODeS, NUMA, Ghent, Belgium
b: KU Leuven, Department of Mechanical Engineering, Ghent, Belgium
c: KU Leuven, Faculty of Economics and Business, ORSTAT, Leuven, Belgium
Date:Received 6 January 2022, Accepted 23 August 2022, Available online 29 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.031
Abstract:Abstract This study emerges from a real-world cargo securing application to ensure safer road transportation and falls into the category of container loading problems with practical constraints. The literature has lacked efficient methods for the secure loading of items with non-identical dimensions, weights and rotations into containers while ensuring that the securing efforts necessary are minimal when also taking into account multi-drop and axle weight constraints. This paper puts forward a new way of ensuring cargo stability that gives rise to a novel combinatorial optimization problem, which is a generalization of the two-dimensional rectangular strip packing problem with orthogonal rotations. We formally demonstrate the intractability of the problem and provide a mixed integer programming formulation. The formulation is based on a discretization of the packing polyhedron, enabling us to model a range of complicated and practical constraints. A group of practical constraints tends to be large in number and makes it difficult to solve the formulation in a reasonable amount of time. In order to overcome this difficulty, we develop an exact algorithmic framework. This framework initially solves certain relaxations of the problem to obtain strong lower bounds before subsequently embedding those lower bounds into a branch-and-cut algorithm. The experimental study serves three purposes: (i) evaluating the performance of the algorithmic framework and the mathematical formulation to assess the merits of the two methods, (ii) identifying the characteristics of hard problem instances and (iii) extracting insights regarding challenges in cargo securing to help managers and practitioners in decision making.
Abstract:本研究来自于一个真实的货物安全应用，以确保更安全的道路运输，属于具有实际约束的集装箱装载问题。文献中缺乏有效的方法来将具有不同尺寸、重量和旋转的物品安全装入容器，同时确保在考虑到多次掉落和轴重约束时所需的安全努力最小化。本文提出了一种保证货物稳定性的新方法，由此产生了一种新的组合优化问题，它是正交旋转的二维矩形条形包装问题的推广。我们正式地证明了问题的棘手性，并提供了一个混合整数规划公式。该公式基于包装多面体的离散化，使我们能够模拟一系列复杂而实际的约束。一组实际的约束往往是大量的，使得在合理的时间内解决公式是困难的。为了克服这一困难，我们开发了一个精确的算法框架。该框架首先解决了问题的某些松弛，以获得强大的下界，然后将这些下界嵌入到分支-切割算法中。实验研究有三个目的:(i)评估算法框架和数学公式的性能，以评估两种方法的优点;(ii)确定困难问题实例的特征;(iii)提取有关货物安全挑战的见解，以帮助管理人员和从业人员决策。
Highlights:

------- Paper (12/32) -------
Title:Getting more third-party participants on board: Optimal pricing and investment decisions in competitive platform ecosystems
Title:获得更多第三方参与者:在竞争平台生态系统中优化定价和投资决策
Author:Weijun Zhu a
Jiaping Xie b
Yu Xia c
Lihong Wei d
Ling Liang e
a: School of Economics & Management, Shanghai Institute of Technology, Shanghai 201418, China
b: College of Business, Shanghai University of Finance and Economics, Shanghai 200433, China
c: College of Business, Nanjing University of Information Science and Technology, Nanjing 210044, China
d: School of International Business, Shanghai University of International Business and Economics, Shanghai 201620, China
e: School of Management, Shanghai University of International Business and Economics, Shanghai 201620, China
Date:Received 6 July 2021, Accepted 24 August 2022, Available online 29 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.035
Abstract:Abstract In two-sided markets, hardware/software platforms meet the unified and personalized demands of consumers through hardware and software products respectively, forming their own ecosystems. For platform enterprises, how to drive third-party value creation through interface extensibility investment (typically on application programming interfaces, or APIs) under different pricing schemes, has become a critical issue under intensified competition. In this paper, we build game theoretic models in four platform competition scenarios (NR, NRT, IR, IRT) considering both investment decisions—no investment (N), investment (I), and pricing decisions—registration fee only ®, registration fee and transaction fee (RT), and analyze the competitive equilibrium in each scenario. Our results show that: (1) Although “reducing price” and “enhancing investment” are partial substitutes, platforms are still incentivized to implement both strategies. Contrary to the traditional wisdom, when platforms with investment charge both registration and transaction fees, the strengthening of cross-side network effect may lead to an increase in registration fee on both sides. (2) The improvement of interface extension effectiveness (cost reduction for developers per unit of investment from platforms) shifts more developers from single-homing to multi-homing, leading to fiercer market competition and thus lower platform profit in equilibrium. (3) Although implementing investment may not be optimal from the profit perspective, it does help platforms in securing a larger market share on the developer side. (4) The existence of same-side network effect enhances both side users’ incentive to enter the market; however, for the platforms, they should carefully mind the irrational price competition to avoid falling into profit-hurting traps.
Abstract:在双边市场中，硬件/软件平台分别通过硬件和软件产品满足消费者统一和个性化的需求，形成各自的生态系统。对于平台企业来说，如何在不同定价方案下，通过接口可扩展性投资(通常是应用程序编程接口或api)来推动第三方价值创造，已成为竞争加剧的关键问题。本文分别考虑投资决策(N)、投资决策(I)和定价决策® -注册费、注册费和交易费(RT)，建立了四种平台竞争情景(NR、NRT、IR、IRT)的博弈理论模型，并分析了每种情景下的竞争均衡。研究结果表明:(1)虽然“降价”和“加大投入”是部分替代策略，但平台仍然会被激励实施这两种策略。与传统观点相反，当有投资的平台同时收取注册费和交易费时，跨境网络效应的加强可能会导致双方注册费的增加。(2)界面扩展效率的提高(开发商单位投资平台成本的降低)使得更多开发商从单归巢转向多归巢，市场竞争更加激烈，平台均衡利润降低。(3)虽然从利润角度来看，实施投资可能不是最优的，但它确实有助于平台在开发者方面获得更大的市场份额。(4)同侧网络效应的存在增强了双方用户进入市场的动机;但对于平台而言，应谨慎对待不合理的价格竞争，避免陷入损害利润的陷阱。
Highlights:

------- Paper (13/32) -------
Title:A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil
Title:巴西多时段汽车运输车装载和运输问题的多起点局部搜索启发式
Author:Antonio Carlos Bonassa
Claudio Barbieri da Cunha
Cassiano Augusto Isler
Department of Transportation Engineering, Escola Politécnica, Universidade de São Paulo, Av. Prof. Almeida Prado, Travessa 2, no 83, 05508-070, São Paulo, Brazil
Date:Received 23 July 2021, Accepted 24 August 2022, Available online 31 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.036
Abstract:Abstract This paper deals with a variation of the Dynamic Multi-Period Auto-Carrier Transportation Problem (DMPACTP) applied to real-world problems in the automotive industry in Brazil. The problem consists in finding the set of vehicles to be loaded into auto-carriers over a planning horizon of multiple days while minimizing the total transportation cost and fulfilling the loading constraints and meeting the delivery deadlines. Our study considers that the loading sequence policy at each stop is not required, and a minimum cost of auto-carriers is calculated on a per trip basis. We propose a Multi-Start Local Search Heuristic (MSLSH) to solve large-scale instances that arise in practice. Computational experiments compare the solutions obtained by means of our heuristic with the exact solutions for four medium size instances faced by a major Brazilian 3PL as well as with the manual allocation for two larger instances comprising 3,865 and 3,809 vehicles that could not be solved using the exact model. The results show that the proposed heuristic is able to obtain the optimal solutions for all the tested medium-sized instances. For large-sized instances that cannot be solved to optimality, we could obtain significant total transportation cost reductions (up to 15.40%) and lower number of vehicles delivered after the promised due date compared to the 3PL manual allocation. The 3PL was satisfied with the results and intends to deploy it into production environment as the MSLSH is robust, does not require extensive parameter calibration and it is easy to implement.
Abstract:本文研究了动态多周期汽车运输问题(DMPACTP)的一个变体，并将其应用于巴西汽车工业的实际问题。问题在于如何在计划的多日范围内找到要装载到汽车运输车上的车辆，同时尽量减少总运输成本，满足装载限制并满足交货期限。我们的研究认为，不需要在每个站点的装载顺序策略，并以每一趟为基础计算汽车承运人的最低成本。我们提出了一个多起点局部搜索启发式(MSLSH)来解决实践中出现的大规模实例。计算实验将通过我们的启发式方法获得的解决方案与巴西一家大型第三方物流公司面临的四个中等规模实例的精确解决方案进行了比较，并将其与两个较大实例(包括3,865辆和3,809辆汽车)的人工分配进行了比较，这些实例无法使用精确模型求解。结果表明，所提出的启发式方法能够获得所有测试中型实例的最优解。对于无法解决到最优的大型实例，与第三方物流手动分配相比，我们可以获得显著的总运输成本降低(高达15.40%)，并且在承诺的到期日之后交付的车辆数量更少。第三方pl对结果感到满意，并打算将其部署到生产环境中，因为MSLSH是健壮的，不需要广泛的参数校准，并且易于实现。
Highlights:

------- Paper (14/32) -------
Title:Nonlinear pricing for yield management and countering strategic consumer behavior
Title:收益管理的非线性定价和对抗战略消费者行为
Author:Moutaz Khouja a
Yuefeng Li b
Jing Zhou c
a: The Belk College of Business, University of North Carolina at Charlotte, Charlotte, 28213 U.S.A.
b: Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, 200030, China
c: The Belk College of BusinessUniversity of North Carolina at Charlotte, Charlotte, 28213 U.S.A.
Date:Received 20 October 2021, Accepted 24 August 2022, Available online 31 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.037
Abstract:Abstract Many models assume that faced with excess inventory, retailers offer price discounts to increase sales. This discount is assumed to be a certain dollar amount or a certain percent of the regular price. However, many retailers use nonlinear pricing, e.g., “Buy one, get one for 50% off,” which we refer to as BOGO. We analyze BOGO within the newsvendor model and identify the reasons for its popularity. We describe the type of products for which BOGO is suitable, identify the optimal BOGO discount, and its effect on the retailer’s profit. We compare BOGO to straight price reduction and analyze the newsvendor’s optimal choice between them. We also examine the two promotions in the presence of strategic consumers. We find that for reasonable values of consumer marginal utility and a given order quantity, BOGO reduces strategic consumers’ chances of obtaining a unit at a discount and their incentive to wait. Therefore, the newsvendor orders a larger quantity with BOGO than with a price reduction. Thus, BOGO can be used to counter strategic consumer behavior. Also, we find that in the presence of strategic consumers, there are cases where it is optimal for the retailer to wait and offer a straight discount at the end of the season. However, with BOGO, it is always optimal to offer a BOGO at the start of the season if realized demand is low. We examine the robustness of our results to different arrival rates and positive salvage value and find that they qualitatively hold.
Abstract:许多模型假设，面对库存过剩，零售商提供价格折扣来增加销售。这个折扣被假定为一定的金额或正常价格的一定百分比。然而，许多零售商采用非线性定价，例如，“买一送一，五折”，我们称之为一送一。我们分析了报亭模型中的买一送一，并找出了它受欢迎的原因。我们描述了适合买一送一的产品类型，确定了最优的买一送一折扣，以及它对零售商利润的影响。我们比较了一送一购和直接降价，并分析了报商在两者之间的最优选择。我们还研究了战略消费者在场的两个促销活动。我们发现，在合理的消费者边际效用值和给定的订单量下，买一送一降低了战略消费者以折扣获得单位的机会和等待的动机。因此，报商以一送一购的方式订购的数量比以降价的方式要多。因此，买一送一可以用来对抗战略性消费者行为。此外，我们发现，在战略消费者的存在下，在某些情况下，零售商等待并在季末提供直接折扣是最优的。然而，对于买一送一，如果实际需求较低，在赛季开始时提供买一送一总是最佳的。我们检查了我们的结果对不同到达率和正残值的稳健性，发现它们在定性上是成立的。
Highlights:

------- Paper (15/32) -------
Title:Approximation schemes for districting problems with probabilistic constraints
Title:带概率约束的区域划分问题的近似格式
Author:Antonio Diglio a
Juanjo Peiró b
Carmela Piccolo a
Francisco Saldanha-da-Gama cd
a: Universitá degli Studi di Napoli Federico II, Department of Industrial Engineering (DII), Piazzale Tecchio, 80 Naples 80125, Italy
b: Departament d’Estadestica i Investigació Operativa, Facultat de Ciéncies Matemátiques, Universitat de Valéncia, Spain
c: Departamento de Estatística e Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, Lisboa 1749-016, Portugal
d: Centro de Matemática, Aplicaçóes Fundamentais e Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, Lisboa 1749-016, Portugal
Date:Received 8 March 2022, Accepted 5 September 2022, Available online 9 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.005
Abstract:Abstract In this work a districting problem with stochastic demand is investigated. Chance-constraints are used to model the balancing requirements. Explicit contiguity constraints are also considered. After motivating the problem and discussing several modeling aspects, an approximate deterministic counterpart is proposed which is the core of new solution algorithms devised. The latter are based upon a location-allocation scheme, whose first step consists of considering either a problem with a sample of scenarios or a sample of single-scenario problems. This leads to two variants of a new heuristic. The second version calls for the use of a so-called attractiveness function as a means to find a good trade-off between the (approximate) solutions obtained for the single-scenario problems. Different definitions of such functions are discussed. Extensive computational tests were performed whose results are reported.
Abstract:本文研究了一个具有随机需求的区域划分问题。机会约束被用来为平衡需求建模。还考虑了显式的相邻约束。在对问题进行激励并讨论了建模的几个方面之后，提出了一种近似确定性对应的求解方法，这是设计新的求解算法的核心。后者基于位置-分配方案，其第一步包括考虑具有场景样本的问题或具有单一场景问题样本的问题。这导致了一种新的启发式的两种变体。第二个版本要求使用所谓的吸引力函数作为一种手段，在为单一场景问题获得的(近似)解决方案之间找到一个良好的权衡。讨论了这些函数的不同定义。进行了广泛的计算测试，报告了测试结果。
Highlights:

------- Paper (16/32) -------
Title:Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints
Title:具有相关边际和概率约束的随机人群运输最后一英里交货
Author:Marco Silva a
João Pedro Pedroso b
Ana Viana c
a: INESC TEC, Porto, Portugal
b: INESC TEC and Universidade do Porto, Porto, Portugal
c: INESC TEC and Polithecnic of Porto, Porto, Portugal
Date:Received 9 May 2022, Accepted 26 October 2022, Available online 4 November 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.10.039
Abstract:Abstract In this work, we study last-mile delivery with the option of crowd shipping. A company uses occasional drivers to complement its fleet in the activity of delivering products to its customers. We model it as a variant of the stochastic capacitated vehicle routing problem. Our approach is data-driven, where not only customer orders but also the availability of occasional drivers are uncertain. It is assumed that marginal distributions of the uncertainty vector are known, but the joint distribution is difficult to estimate. We optimize considering a worst-case joint distribution and model with a strategic planning perspective, where we calculate an optimal a priori solution before the uncertainty is revealed. A limit on the infeasibility of the routes due to the capacity is imposed using probabilistic constraints. We propose an extended formulation for the problem using column-dependent rows and implement a branch-price-and-cut algorithm to solve it. We also develop a heuristic approximation to cope with larger instances of the problem. Through computational experiments, we analyze the solution and performance of the implemented algorithms.
Abstract:摘要本文研究了群体配送的最后一英里配送问题。一家公司使用临时司机来补充其车队，将产品交付给客户。我们将其建模为随机容量车辆路径问题的一个变体。我们的方法是数据驱动的，不仅是客户订单，还有临时司机的可用性都是不确定的。假设不确定性向量的边际分布已知，但联合分布难以估计。我们从战略规划的角度考虑最坏情况的联合分布和模型进行优化，在不确定性被揭示之前，我们计算一个最优的先验解决方案。由于容量的限制，路由的不可行性是使用概率约束施加的。我们提出了一个使用列相关行来解决问题的扩展公式，并实现了一个分支价格和切割算法来解决它。我们还开发了一种启发式近似来处理更大的问题实例。通过计算实验，分析了所实现算法的解和性能。
Highlights:

------- Paper (17/32) -------
Title:On the finite-sample statistical validity of adaptive fully sequential procedures
Title:关于自适应全序贯程序的有限样本统计效度
Author:Zhenxia Cheng a
Jun Luo a
Ruijing Wu bc
a: Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai 200030, China
b: School of Business and Management, Shanghai International Studies University, Shanghai 200083, China
c: Institute of Intelligent Operations and Supply Chain Management, Shanghai International Studies University, Shanghai 20083, China
Date:Received 8 November 2021, Accepted 18 November 2022, Available online 23 November 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.11.038
Abstract:Abstract We consider the simulation optimization problem of selecting the best system design from a finite set of alternatives, which is known as ranking and selection (R&S). Many fully sequential procedures have been proposed to solve the R&S problem using a static sampling rule in order to ensure a finite-sample statistical guarantee. In this paper, we develop fully sequential procedures that can incorporate various adaptive sampling rules, based on a modification of Paulson’s bound Paulson (1964), while still preserving the finite-sample guarantee. In particular, we propose an adaptive sampling rule that utilizes the consecutively updated sample mean and sample variance information by solving a minimization problem of the approximated total sample size. Finally, we demonstrate the efficiency of the proposed procedures with several existing procedures through extensive simulation experiments, and apply them to solve an ambulance dispatching problem.
Abstract:摘要研究了从有限备选方案集中选择最优系统设计的仿真优化问题，即排序与选择问题(R&S)。为了保证有限样本的统计保证，已经提出了许多用静态抽样规则来解决R&S问题的全序贯方法。在本文中，我们开发了基于保尔森边界保尔森(Paulson’s bound, 1964)的修正的全顺序过程，可以在保留有限样本保证的情况下，包含各种自适应抽样规则。特别地，我们提出了一种利用连续更新的样本均值和样本方差信息的自适应抽样规则，通过解决近似总样本量的最小化问题。最后，通过大量的模拟实验，我们用几个现有的程序验证了所提出的程序的有效性，并将其应用于解决一个救护车调度问题。
Highlights:

------- Paper (18/32) -------
Title:Supporting strategy selection in multiobjective decision problems under uncertainty and hidden requirements
Title:不确定性和隐需求下多目标决策问题的策略选择支持
Author:Lauri Neuvonen ab
Matthias Wildemeersch b
Eeva Vilkkumaa a
a: Department of Information and Service Management, School of Business, Aalto University, Ekonominaukio 1, Espoo, 02150, Finland
b: International Institute for Applied Systems Analysis (IIASA), Schlossplatz 1, A-2361 Laxenburg, Austria
Date:Received 8 September 2021, Revised 14 September 2022, Accepted 25 September 2022, Available online 7 October 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.036
Abstract:Abstract Decision-makers are often faced with multi-faceted problems that require making trade-offs between multiple, conflicting objectives under various uncertainties. The task is even more difficult when considering dynamic, non-linear processes and when the decisions themselves are complex, for instance in the case of selecting trajectories for multiple decision variables. These types of problems are often solved using multiobjective optimization (MOO). A typical problem in MOO is that the number of Pareto optimal solutions can be very large, whereby the selection process of a single preferred solution is cumbersome. Moreover, preference between model-based solutions may not be determined only by their objective function values, but also in terms of how robust and implementable these solutions are. In this paper, we develop a methodological framework to support the identification of a small but diverse set of robust Pareto optimal solutions. In particular, we eliminate non-robust solutions from the Pareto front and cluster the remaining solutions based on their similarity in the decision variable space. This enables a manageable visual inspection of the remaining solutions to compare them in terms of practical implementability. We illustrate the framework and its benefits by means of an epidemic control problem that minimizes deaths and economic impacts, and a screening program for colorectal cancer that minimizes cancer prevalence and costs. These examples highlight the general applicability of the framework for disparate types of decision problems and process models.
Abstract:决策者经常面临多方面的问题，需要在各种不确定性下的多个相互冲突的目标之间进行权衡。当考虑动态非线性过程和决策本身复杂时，例如在为多个决策变量选择轨迹的情况下，任务就更加困难了。这类问题通常使用多目标优化(MOO)来解决。MOO的一个典型问题是帕累托最优解的数量可能非常多，因此单个首选解的选择过程非常繁琐。此外，基于模型的解决方案之间的偏好可能不仅由它们的目标函数值决定，而且还取决于这些解决方案的健壮性和可实现性。在本文中，我们开发了一个方法学框架来支持识别一个小而多样的鲁棒帕累托最优解集。特别地，我们从帕累托前面消除非鲁棒解，并根据其在决策变量空间中的相似性对其余解进行聚类。这样就可以对剩余的解决方案进行可管理的可视化检查，从而在实际可实现性方面对它们进行比较。我们通过将死亡和经济影响降至最低的流行病控制问题，以及将癌症患病率和成本降至最低的结直肠癌筛查计划来说明框架及其益处。这些例子强调了框架对于不同类型的决策问题和过程模型的一般适用性。
Highlights:

------- Paper (19/32) -------
Title:Comparative performance analysis of frontier-based efficiency measurement methods – A Monte Carlo simulation
Title:基于边界的效率测量方法的比较性能分析。蒙特卡罗模拟
Author:Heinz Ahn a
Marcel Clermont b
Julia Langner a
a: Department of Business Sciences, Technische Universität Braunschweig, Fallersleber-Tor-Wall 23, 38100 Braunschweig, Germany
b: Cooperative University Gera-Eisenach, Am Wartenberg 2, 99817 Eisenach, Germany
Date:Received 19 May 2021, Accepted 26 September 2022, Available online 1 October 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.039
Abstract:Abstract In the last decades, various frontier-based efficiency measurement methods have been developed. So far, there is only limited knowledge with respect to the question to what extent a certain method is advantageous in different scenarios. We address this issue by a simulation study. In the respective scenarios, nine parameters are varied that reflect the specific structure of the data and knowledge about the competitive environment of the units to be evaluated. In contrast to other studies, we consider, e.g., multiple inputs and outputs. Furthermore, among other things, we assume lower levels of efficiency to reflect characteristics of markets with weaker competition. The methods compared are Data Envelopment Analysis, Stochastic Frontier Analysis, Stochastic Non-Smooth Envelopment of Data, and Normalized Additive Analysis. They are assessed with respect to two main purposes of efficiency measurement, the correct estimation of the efficiency degrees as well as the accurate determination of the ranking of the compared units. It is shown that, depending on the chosen purpose and the data scenario, there are major differences regarding the performance of the methods. The results of our study provide a comprehensive basis for selecting between the methods.
Abstract:在过去的几十年里，各种基于前沿的效率测量方法已经发展起来。到目前为止，关于某一种方法在不同场景下的优势程度，我们的知识有限。我们通过模拟研究来解决这个问题。在各自的场景中，有9个参数是不同的，它们反映了数据的具体结构和有关待评估单位竞争环境的知识。与其他研究相反，我们考虑了多输入和多输出。此外，在其他方面，我们假设较低的效率水平，以反映竞争较弱的市场特征。比较的方法有数据包络分析、随机前沿分析、数据随机非光滑包络和归一化加性分析。对其进行评价的两个主要目的是正确估计效率程度和准确确定比较单位的排名。结果表明，根据所选择的目的和数据场景，这些方法的性能存在重大差异。我们的研究结果为两种方法的选择提供了全面的依据。
Highlights:

------- Paper (20/32) -------
Title:Multi-league sports scheduling with different leagues sizes
Title:不同联盟规模的多联盟运动调度
Author:Miao Li a
Morteza Davari b
Dries Goossens ac
a: Department of Business Informatics and Operations Management, Ghent University, Tweekerkenstraat 2, Gent 9000, Belgium
b: SKEMA Business School, Université Côte d’Azur, Avenue Willy Brandt, Lille 59777, France
c: FlandersMake@UGent – Core Lab CVAMO, Ghent, Belgium
Date:Received 18 July 2021, Accepted 3 October 2022, Available online 12 October 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.10.010
Abstract:Abstract This paper introduces a general multi-league sports scheduling problem where timetables for multiple leagues must be determined simultaneously, a practical and challenging problem in amateur and youth sports. We consider round robin leagues with different numbers of teams, and hence also requiring different numbers of rounds. As the number of simultaneous home games that clubs can organize for their teams is limited by the capacity of their venue, the objective is to minimize capacity violations. Along with a mixed integer programming model which is formulated to optimize the starting round of each league as well as to settle when teams have their home games, we develop various methods to construct an initial solution, and a heuristic with several local search and perturbation components to improve on this. Extensive computational experiments reveal that our heuristic can efficiently provide high-quality solutions for artificial and realistic instances. We also illustrate the impact of using different sets of home-away patterns on the total venue capacity violations. Results on a real-life application from the Belgian national football association indicate that schedules based on our heuristic allow teams to substantially decrease their venue capacity without causing meaningfully more violations.
Abstract:摘要本文介绍了一个在业余和青少年体育中具有实际意义和挑战性的多联赛运动调度问题，该问题需要同时确定多个联赛的时间表。我们考虑的循环赛联赛有不同数量的球队，因此也需要不同数量的回合。由于俱乐部可以同时为其球队组织的主场比赛的数量受到场地容量的限制，其目标是尽量减少容量违规。随着混合整数规划模型的制定，以优化每个联赛的开始回合，以及确定球队的主场比赛，我们开发了各种方法来构造初始解，以及具有几个局部搜索和扰动组件的启发式来改进这一点。大量的计算实验表明，我们的启发式方法可以有效地为人工和现实实例提供高质量的解决方案。我们还说明了使用不同的主客场模式对总场馆容量违规的影响。来自比利时国家足球协会的实际应用结果表明，基于我们启发式的时间表允许球队在不造成更多违规的情况下大幅减少场地容量。
Highlights:

------- Paper (21/32) -------
Title:Routing in offshore wind farms: A multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat
Title:海上风电场布线:联合使用服务作业船和安全转运船的多时段定位和维护问题
Author:Chandra Ade Irawan ab
Stefano Starita c
Hing Kai Chan ab
Majid Eskandarpour de
Mohammad Reihaneh de
a: Nottingham University Business School China, University of Nottingham, Ningbo, China
b: Nottingham Ningbo China Beacons of Excellence Research and Innovation Institute, China
c: Sasin School of Management, Chulalongkorn University, Bangkok, Thailand
d: IESEG School of Management, 3 rue de la Digue, 59000 Lille, France
e: LEM-CNRS UMR 9221, 3 rue de la Digue, 59000 Lille, France
Date:Received 6 June 2021, Accepted 29 July 2022, Available online 5 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.07.051
Abstract:Abstract This paper studies an interesting logistical problem related to maintaining a set of selected turbines in offshore wind farms. A service operation vessel (SOV), used to support maintenance activities, also carries a safe transfer boat (STB), which is used to transport technicians, parts, and equipment to the turbines. The maintenance activities are optimised over a planning horizon by simultaneously coordinating the SOV and the STB. A mixed-integer linear programming model is designed, where the objective function is to minimise the total maintenance cost. As the proposed mathematical model is hard to solve with a commercial solver, a decomposition approach is developed. A two-stage stochastic programming model is also designed to tackle uncertain conditions, including the duration of maintenance and the STB’s travel time. The performance of the solution method is evaluated using the Thanet Offshore Wind Farm, in the southeast of the UK. The results of our experiments show that joint use of an SOV and an STB can yield a lower total maintenance cost than only using an SOV or crew travel vessels (CTVs) that are currently the common practice in maintaining offshore turbines.
Abstract:本文研究了一个有趣的后勤问题，与维护一组选定的海上风电场涡轮机有关。用于支持维护活动的服务操作船(SOV)还携带安全转移船(STB)，用于将技术人员、部件和设备运送到涡轮机。通过同时协调SOV和STB，在计划范围内优化维护活动。设计了一个混合整数线性规划模型，其目标函数是使总维修费用最小化。针对所提出的数学模型难以用商业求解器求解的问题，提出了一种分解方法。此外，还设计了两阶段随机规划模型，以解决维修时间和机顶盒行驶时间等不确定条件。在英国东南部的萨尼特海上风电场对该方法的性能进行了评估。我们的实验结果表明，联合使用SOV和STB可以产生较低的总维护成本，而仅使用SOV或船员旅行船(ctv)是目前维护海上涡轮机的常见做法。
Highlights:

------- Paper (22/32) -------
Title:Long-run optimal pricing in electricity markets with non-convex costs
Title:非凸成本电力市场的长期最优定价
Author:Conleigh Byers
Gabriela Hug
Power Systems Laboratory, ETH Zurich, Zurich, Switzerland
Date:Received 9 August 2021, Accepted 31 July 2022, Available online 5 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.07.052
Abstract:Abstract Determining optimal prices in non-convex markets remains an unsolved challenge. Non-convex costs are critical in electricity markets, as startup costs and minimum operating levels yield a non-convex optimal value function over demand levels. While past research largely focuses on the performance of different non-convex pricing frameworks in the short-run or uses convex approximations, we determine long-run adapted resource mixes associated with each pricing framework while preserving the full extent of the non-convex operations. We frame optimal pricing in terms of social surplus achieved and transfer of consumer to producer surplus in adapted long-run market equilibria. We find that convex hull pricing achieves the highest social surplus and is also associated with the lowest transfer of consumer to producer surplus. Marginal prices determined by fixing integer variables to their optimal values in the pricing run are also associated with high social surplus and high consumer surplus when the optimality gap in the original mixed integer linear program is very small. Other pricing frameworks tend to over-compensate inframarginal units, leading to resource mixes with lower social surplus and a greater transfer of consumer surplus to producer surplus in the long-run.
Abstract:在非凸市场中确定最优价格仍然是一个未解决的挑战。非凸成本在电力市场中至关重要，因为启动成本和最低运行水平会在需求水平上产生非凸最优价值函数。虽然过去的研究主要集中在不同的非凸定价框架在短期内的性能或使用凸近似，但我们确定了与每个定价框架相关的长期适应资源组合，同时保留了非凸操作的全部范围。我们根据实现的社会剩余和在适应的长期市场均衡中消费者向生产者剩余的转移来构建最优定价。我们发现凸包定价能够实现最高的社会剩余，同时也与消费者向生产者剩余的最低转移有关。当原始混合整数线性规划的最优差距很小时，将整数变量固定到定价运行的最优值所确定的边际价格也与高社会剩余和高消费者剩余相关。其他定价框架倾向于过度补偿超边际单位，导致资源混合与较低的社会剩余和更大的消费者剩余向生产者剩余的长期转移。
Highlights:Highlights • Non-convex costs make pricing in electricity markets challenging. • Different pricing methods can lead to different resource mixes in the long run. • With price-responsive demand, optimality gaps may impact total producer surplus. • Make-whole payments can be small in long-run adapted systems with flexible demand. • Convex hull pricing is associated with the highest consumer surplus.

------- Paper (23/32) -------
Title:An integrated multitiered supply chain network model of competing agricultural firms and processing firms: The case of fresh produce and quality
Title:竞争农业企业和加工企业的综合多层供应链网络模型:以新鲜农产品和质量为例
Author:Deniz Besik a
Anna Nagurney b
Pritha Dutta c
a: Department of Analytics and Operations, Robins School of Business, University of Richmond, Richmond, VA 23173, United States
b: Department of Operations and Information Management, Isenberg School of Management, University of Massachusetts, Amherst, MA 01003, United States
c: Department of Management and Management Science, Lubin School of Business, Pace University, New York City, NY 10038, United States
Date:Received 15 June 2021, Revised 20 June 2022, Accepted 31 July 2022, Available online 6 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.07.053
Abstract:Abstract In this paper, we develop an integrated multitiered competitive agricultural supply chain network model in which agricultural firms and processing firms compete to sell their differentiated products. The focus here is on fresh produce and minimally processed such agricultural products, with quality also captured. The competition among agricultural firms and processing firms is studied through game theory, where the governing Cournot–Nash equilibrium conditions correspond to a variational inequality problem. The algorithm, at each iteration, yields explicit closed form expressions for the agricultural product path flows, the agricultural product shipments from agricultural firms to the processing firms, and the Lagrange multipliers. A numerical study consisting of several supply chain disruption scenarios demonstrates the applicability of our modeling framework.
Abstract:摘要本文建立了农业企业和加工企业竞争销售差异化产品的一体化多层次竞争农业供应链网络模型。这里的重点是新鲜农产品和最低限度加工的农产品，同时也关注质量。通过博弈论研究了农业企业和加工企业之间的竞争，其中支配的Cournot-Nash均衡条件对应于一个变分不等式问题。该算法在每次迭代中都产生了农产品路径流、农产品从农业企业到加工企业的出货量以及拉格朗日乘子的显式封闭表达式。由几个供应链中断场景组成的数值研究证明了我们的建模框架的适用性。
Highlights:

------- Paper (24/32) -------
Title:Bowley vs. Pareto optima in reinsurance contracting
Title:再保险合同中的鲍利和帕累托最优
Author:Tim J. Boonen a
Mario Ghossoub b
a: Amsterdam School of Economics University of Amsterdam Roetersstraat 11 1018 WB, Amsterdam The Netherlands
b: University of Waterloo Department of Statistics and Actuarial Science 200 University Ave. W. Waterloo ON N2L 3G1 Canada
Date:Received 30 March 2022, Accepted 4 August 2022, Available online 9 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.003
Abstract:Abstract The notion of a Bowley optimum has gained recent popularity as an equilibrium concept in problems of risk sharing and optimal reinsurance. In this paper, we examine the relationship between Bowley optimality and Pareto efficiency in a problem of optimal reinsurance, under fairly general preferences. Specifically, we show that Bowley-optimal contracts are indeed Pareto efficient but they make the insurer indifferent with the status quo (hence providing a partial first welfare theorem). Moreover, we show that only those Pareto-efficient contracts that make the insurer indifferent between suffering the loss and entering into the reinsurance contract are Bowley optimal (hence providing a partial second welfare theorem). We interpret these result as indicative of the limitations of Bowley optimality as an equilibrium concept in this literature. We also discuss relationships with competitive equilibria, and we provide illustrative examples.
Abstract:Bowley最优概念作为风险分担和最优再保险问题中的一种均衡概念，近年来得到了广泛的应用。在这篇论文中，我们研究了在相当一般的偏好下，最优再保险问题中的鲍利最优性和帕累托效率之间的关系。具体来说，我们证明了鲍利最优契约确实是帕累托有效的，但它们使保险人对现状漠不关心(因此提供了部分第一福利定理)。此外，我们还证明，只有那些使保险人在遭受损失和进入再保险合同之间漠不关心的帕累托效率契约才是鲍利最优契约(因此提供了部分第二福利定理)。我们将这些结果解释为本文献中鲍利最优性作为均衡概念的局限性的指示。我们还讨论了与竞争均衡的关系，并提供了说明性的例子。
Highlights:

------- Paper (25/32) -------
Title:Online voluntary mentoring: Optimising the assignment of students and mentors
Title:在线志愿辅导:优化学生和导师的分配
Author:Péter Biró ab
Márton Gyetvai a
a: Institute of Economics, CERS, Tóth Kálmán u. 4, Budapest, 1097, Hungary
b: Corvinus University of Budapest, Fövám tér 8, Budapest, 1093, Hungary
Date:Received 15 March 2021, Accepted 5 August 2022, Available online 10 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.008
Abstract:Abstract After the closure of the schools in Hungary from March 2020 due to the pandemic, many students were left at home with no or not enough parental help for studying, and in the meantime some people had more free time and willingness to help others in need during the lockdown. In this paper we describe the optimisation aspects of a joint NGO project for allocating voluntary mentors to students using a web-based coordination mechanism. The goal of the project has been to form optimal pairs and study groups by taking into account the preferences and the constraints of the participants. In this paper, we present the optimisation concept and the integer programming techniques used for solving the allocation problems. Furthermore, we conducted computational simulations on real and generated data to evaluate the performance of this dynamic matching scheme under different parameter settings.
Abstract:匈牙利自2020年3月起因疫情关闭学校后，许多学生被留在家中，没有或没有足够的父母帮助学习，与此同时，一些人在封锁期间有更多的空闲时间和意愿帮助需要帮助的人。在本文中，我们描述了一个联合非政府组织项目的优化方面，该项目使用基于网络的协调机制为学生分配志愿导师。该项目的目标是通过考虑参与者的偏好和约束条件，形成最佳的配对和研究小组。在本文中，我们提出了用于解决分配问题的优化概念和整数规划技术。在此基础上，我们对真实数据和生成数据进行了计算仿真，以评估该动态匹配方案在不同参数设置下的性能。
Highlights:Highlights • Application of allocating voluntary mentors to students for online mentoring in Hungary during the COVID-lockdowns. • Optimal solutions with a MILP model based on personal characteristics, social priorities, and preferences. • Special features are the possibility of mentoring in pairs and groups, batch matching runs. • Computer simulations for generated data to evaluate the performance of dynamic allocations under various settings and objectives.

------- Paper (26/32) -------
Title:Managing quality and pricing during a product recall: An analysis of pre-crisis, crisis and post-crisis regimes
Title:在产品召回期间管理质量和定价:危机前，危机和危机后制度的分析
Author:Arka Mukherjee a
Margarida Carvalho b
Georges Zaccour a
a: GERAD and HEC Montréal 3000, Chemin de la Côte-Sainte-Catherine Montréal, Québec H3T 2A7 Canada
b: CIRRELT and Département d’Informatique et de Recherche Opérationnelle Université de Montréal, Montréal, Quebéc H3T 1J4, Canada
Date:Received 4 October 2021, Accepted 9 August 2022, Available online 14 August 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.012
Abstract:Abstract Product recalls are often consequences of quality failures. While such failures are related to a manufacturer’s or supplier’s design quality, the perceived quality of products may be severely damaged when a product harm crisis occurs. However, most often, such a crisis will not last forever, and a firm at fault eventually recovers. Considering an optimal control model, we investigate the optimal pricing decisions, advertising and quality efforts of a firm while it anticipates a product recall and a subsequent recovery. We show that the decisions and profits of the manufacturer vary widely with the stochastic parameters: crisis likelihood, recovery likelihood, crisis impact and recovery intensity. We illustrate that myopic firms are more severely affected by a product recall than farsighted firms when the impact of recall is high. However, it might not be so detrimental to take myopic decisions for low impact recalls. In the absence of recovery, a product recall can lead to bankruptcy. High initial perceived quality may not insulate a firm against bankruptcy.
Abstract:产品召回往往是质量问题的结果。虽然此类故障与制造商或供应商的设计质量有关，但当产品损害危机发生时，产品的感知质量可能会受到严重损害。然而，大多数情况下，这样的危机不会永远持续下去，有过错的公司最终会复苏。考虑一个最优控制模型，我们调查了一个公司在预期产品召回和随后的恢复时的最优定价决策、广告和质量努力。我们表明，制造商的决策和利润随随机参数(危机可能性、恢复可能性、危机影响和恢复强度)的变化而有很大差异。我们证明，当召回的影响较大时，短视的公司比有远见的公司受到产品召回的影响更严重。然而，对于低影响的召回，采取短视的决定可能并不是那么有害。在没有恢复的情况下，产品召回可能导致破产。高的初始质量并不能使一家公司免于破产。
Highlights:

------- Paper (27/32) -------
Title:Methods for constrained optimization of expensive mixed-integer multi-objective problems, with application to an internal combustion engine design problem
Title:昂贵的混合整数多目标问题的约束优化方法及其在内燃机设计问题中的应用
Author:João A. Duro a
Umud Esat Ozturk b
Daniel C. Oara a
Shaul Salomon ac
Robert J. Lygoe d
Richard Burke b
Robin C. Purshouse a
a: Department of Automatic Control and Systems Engineering, The University of Sheffield, UK
b: The Institute for Advanced Automotive Propulsion Systems, University of Bath, Bath, BA2 7AY, UK
c: ORT Braude College of Engineering, Israel
d: Product Development Europe, Dunton Technical Centre UK, Ford Motor Co. Ltd, UK
Date:Received 10 December 2020, Accepted 24 August 2022, Available online 6 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.08.032
Abstract:Abstract Engineering design optimization problems increasingly require computationally expensive high-fidelity simulation models to evaluate candidate designs. The evaluation budget may be small, limiting the effectiveness of conventional multi-objective evolutionary algorithms. Bayesian optimization algorithms (BOAs) are an alternative approach for expensive problems but are underdeveloped in terms of support for constraints and non-continuous design variables—both of which are prevalent features of real-world design problems. This study investigates two constraint handling strategies for BOAs and introduces the first BOA for mixed-integer problems, intended for use on a real-world engine design problem. The new BOAs are empirically compared to their closest competitor for this problem—the multi-objective evolutionary algorithm NSGA-II, itself equipped with constraint handling and mixed-integer components. Performance is also analysed on two benchmark problems which have similar features to the engine design problem, but are computationally cheaper to evaluate. The BOAs offer statistically significant convergence improvements of between 5.9% and 31.9% over NSGA-II across the problems on a budget of 500 design evaluations. Of the two constraint handling methods, constrained expected improvement offers better convergence than the penalty function approach. For the engine problem, the BOAs identify improved feasible designs offering 36.4% reductions in nitrogen oxide emissions and 2.0% reductions in fuel consumption when compared to a notional baseline design. The use of constrained mixed-integer BOAs is recommended for expensive engineering design optimization problems.
Abstract:工程设计优化问题越来越需要计算昂贵的高保真仿真模型来评估候选设计。评价预算可能较小，限制了传统的多目标进化算法的有效性。贝叶斯优化算法(BOAs)是解决昂贵问题的一种替代方法，但在对约束和非连续设计变量的支持方面还不发达——这两者都是现实设计问题的普遍特征。本研究研究了BOA的两种约束处理策略，并介绍了用于混合整数问题的第一个BOA，旨在用于现实世界的引擎设计问题。在这个问题上，新的boa与它们最接近的竞争对手NSGA-II进行了实证比较，NSGA-II本身配备了约束处理和混合整数组件。性能还分析了两个基准问题，这两个问题具有与发动机设计问题相似的特征，但计算成本更低。在500个设计评估预算的问题上，boa提供了统计上显著的收敛性改进，在NSGA-II的5.9%到31.9%之间。在两种约束处理方法中，约束期望改进方法的收敛性优于惩罚函数方法。对于发动机问题，boa确定了改进的可行设计，与名义基准设计相比，氮氧化物排放量减少36.4%，燃料消耗减少2.0%。对于昂贵的工程设计优化问题，建议使用约束混合整数boa。
Highlights:Highlights • Engine design problems are compute-expensive, mixed-integer and constrained. • A multi-objective Bayesian optimizer is extended to solve these type of problems. • Probability of feasibility constraint handling is better than using penalty functions. • The new Bayesian optimizer converges faster than a popular dominance-based algorithm. • The use of feasible and infeasible solutions in the training set improves performance.

------- Paper (28/32) -------
Title:Dynamic firm performance and estimator choice: A comparison of dynamic panel data estimators
Title:动态企业绩效和估计量的选择:动态面板数据估计量的比较
Author:Joshua Cave a
Kausik Chaudhuri a
Subal C. Kumbhakar b
a: Leeds University Business School, University of Leeds, Maurice Keyworth Building, Leeds, LS61AN, UK
b: Department of Economics, Binghamton University, Binghamton, NY 13902, United States
Date:Received 13 July 2021, Accepted 9 September 2022, Available online 17 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.009
Abstract:Abstract Dynamic panel data models are increasingly and extensively used in operational research and performance analysis as researchers seek to better understand the dynamic behaviors of firms. However, estimation of the lagged dependent variable in conjunction with the time-invariant individual effect leads to a number of econometric issues. While several methodologies exist to overcome such complexities, there is little consensus on the appropriate method of estimation. In this paper, we evaluate the performance of different dynamic panel estimators across a range of common settings experienced by researchers. Instead of focusing on one single criterion of assessment, we employ multiple evaluative metrics across multiple experiments to provide a more extensive analysis of dynamic panel estimators. Taking all simulations into account, we find the quasi-maximum likelihood estimator to be the most robust and reliable estimator across empirical settings. We illustrate our findings with two empirical applications and show that the choice of estimator significantly affects the interpretation of firms’ productivity and efficiency persistence.
Abstract:动态面板数据模型越来越广泛地应用于运筹学和绩效分析中，以更好地理解企业的动态行为。然而，滞后因变量的估计与时不变的个体效应一起导致了许多计量经济学问题。虽然有几种方法可以克服这种复杂性，但在适当的估计方法上几乎没有共识。在本文中，我们评估了不同动态面板估计器在研究人员经历的一系列常见设置中的性能。我们不是专注于一个单一的评估标准，而是在多个实验中采用多个评估指标，以提供更广泛的动态面板估计器分析。考虑到所有的模拟，我们发现准最大似然估计量在经验设置中是最稳健和可靠的估计量。我们用两个实证应用说明了我们的发现，并表明估计量的选择显著影响对公司生产率和效率持久性的解释。
Highlights:

------- Paper (29/32) -------
Title:Optimal multivariate financial decision making
Title:多元最优财务决策
Author:C. Bernard ab
L. De Gennaro Aquino cd
S. Vanduffel b
a: Department of Accounting, Law and Finance, Grenoble Ecole de Management, France
b: Faculty of Economics, Vrije Universiteit Brussel, Belgium
c: Department of Information Systems and Management Engineering, College of Business, Southern University of Science and Technology (SUSTech), Shenzhen, China
d: Department of Mathematical Sciences, University of Copenhagen, Denmark
Date:Received 26 September 2021, Accepted 19 September 2022, Available online 27 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.017
Abstract:Abstract Agents who pursue optimal portfolio choice by optimizing a univariate objective (e.g., an expected utility) obtain optimal payoffs that are increasing with each other (situation of no diversification). This situation may lead to an undesirable level of systemic risk for society. A regulator may consider a global perspective and aim to enforce diversification among the various portfolios by optimizing a suitable multivariate objective. We explain that optimal solutions satisfy a notion of multivariate cost-efficiency and provide an algorithm to obtain multivariate cost-efficient payoffs. We also assess the cost of diversification and provide the strategy that the regulator should pursue for obtaining the desired level of diversification.
Abstract:通过优化单变量目标(例如，预期效用)来追求最优投资组合选择的代理人获得相互增加的最优收益(无多样化的情况)。这种情况可能会给社会带来不受欢迎的系统性风险。监管机构可以从全球角度考虑，并通过优化合适的多元目标来实现各种投资组合的多样化。我们解释了最优解满足多元成本效益的概念，并提供了一个算法来获得多元成本效益的收益。我们还评估了多元化的成本，并提供了监管机构为获得理想的多元化水平而应采取的策略。
Highlights:

------- Paper (30/32) -------
Title:Contractual flexibility, firm effort, and subsidy design: A comparison of PPP project contracts
Title:合同灵活性、坚定努力和补贴设计:PPP项目合同的比较
Author:Zhuo Feng a
Jinbo Song a
Xiaoxing Yang a
Ran Guo b
a: School of Economics and Management, Dalian University of Technology, Dalian 116024, China
b: Beijing Electric Vehicle Co., Ltd., Beijing 100176, China
Date:Received 3 August 2021, Accepted 20 September 2022, Available online 26 September 2022, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.09.018
Abstract:Abstract A growing number of infrastructure projects in developing countries are being provided by private firms through public-private partnership (PPP). We compare rigid and flexible contracts for PPP projects under demand uncertainty, the former of which is not allowed to be adjusted through renegotiation when demand uncertainty materializes while the latter is. In comparing the rigid and the flexible contracts, we highlight their respective strengths of inducing firm effort and adaptation to the uncertainties. We present clear conditions under which each contract type can lead to better performance, measured by firm effort, firm profit, and consumer surplus. We have further investigated the effects of government subsidies on the comparison results. We show that government subsidies are able to improve the comparative advantages of the flexible contract, regardless of subsidy forms. The effects of different government subsidies in improving firm effort to the first-best level under the two contract types are also analyzed.
Abstract:发展中国家越来越多的基础设施项目是由私营公司通过公私合作伙伴关系(PPP)提供的。我们比较了需求不确定性下PPP项目刚性合同和柔性合同，刚性合同在需求不确定性发生时不允许通过重新谈判进行调整，柔性合同则可以。在比较刚性契约和柔性契约时，着重指出了刚性契约和柔性契约各自在诱导企业努力和适应不确定性方面的优势。我们提出了明确的条件，在这些条件下，每种合同类型都可以导致更好的绩效，以企业努力、企业利润和消费者剩余来衡量。我们进一步研究了政府补贴对比较结果的影响。研究表明，无论补贴形式如何，政府补贴都能提高柔性合同的比较优势。分析了在两种契约类型下，不同政府补贴对企业努力达到一优水平的影响。
Highlights:

------- Paper (31/32) -------
Title:Corrigendum to ‘Optimization of personalized price discounting scheme for one-way station-based carsharing systems’ [European Journal of Operational Research 303 (2022) 220–238]
Title:“基于单向站的汽车共享系统的个性化价格折扣方案的优化”勘误[欧洲运筹学杂志303 (2022)220-238]
Author:Si Zhang a
Huijun Sun a
Xu Wang a
Ying Lv a
Jianjun Wu b
a: Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Ministry of Transport, Beijing Jiaotong University, Beijing, China
b: State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, China
Date:Available online 3 January 2023, Version of Record 19 January 2023.
DOI:https://doi.org/10.1016/j.ejor.2022.12.031
Abstract:
Abstract:
Highlights:

------- Paper (32/32) -------