Lei Li, Kwan Raymond, Lin Zhiyuan
School of Computing, University of Leeds, Woodhouse Lane, Leeds, LS2 9JT West Yorkshire UK.
Institute for Transport Studies, University of Leeds, Woodhouse Lane, Leeds, LS2 9JT West Yorkshire UK.
SN Oper Res Forum. 2025;6(3):121. doi: 10.1007/s43069-025-00529-7. Epub 2025 Aug 14.
Real-world combinatorial optimization problems are mostly NP-hard, and often only near-optimal solutions can be obtained practically. To differentiate as fine-grained as possible the near-optimal solutions is therefore desirable. Moreover, a real-world problem may have numerous possible structural properties of concern to the practitioners, too numerous to be all elicited and incorporated as optimization criteria in an objective function. In contrast with pure heuristics, we consider hybrid (meta-)heuristics that utilize an exact solver iteratively to solve a series of significantly reduced problem instances converging to near-optimal solutions within practical time. To avoid the hybrid heuristic being stranded in a "poorly differentiated" solution space, an effective objective function design plays an important role. We propose a methodology to benchmark the effectiveness of alternative objective function designs. The main metric used is the structural similarity between the solutions obtained by the hybrid heuristic and by the exact solver. Several other solution features are also distilled and aggregated in the benchmark. This methodology is explained and demonstrated on a train unit scheduling problem tested with four alternative objective functions. The results show that two of them are significantly more effective than the others in differentiating solutions of different qualities and speeding up the solution process. Moreover, some criteria not modeled explicitly could also be satisfied implicitly in the effective objective designs.
现实世界中的组合优化问题大多是NP难问题,实际中通常只能获得近似最优解。因此,尽可能精细地区分近似最优解是很有必要的。此外,一个现实世界的问题可能有许多从业者关心的可能结构属性,数量太多以至于无法全部引出并作为目标函数中的优化标准纳入。与纯启发式算法不同,我们考虑混合(元)启发式算法,该算法迭代地利用精确求解器来解决一系列显著简化的问题实例,在实际时间内收敛到近似最优解。为了避免混合启发式算法陷入“区分度差”的解空间,有效的目标函数设计起着重要作用。我们提出了一种方法来评估替代目标函数设计的有效性。使用的主要指标是混合启发式算法和精确求解器获得的解之间的结构相似性。在基准测试中还提炼和汇总了其他几个解的特征。该方法在一个列车单元调度问题上进行了解释和演示,该问题用四个替代目标函数进行了测试。结果表明,其中两个在区分不同质量的解和加快求解过程方面明显比其他的更有效。此外,一些未明确建模的标准在有效的目标设计中也可能被隐含地满足。