一种增强的大邻域搜索方法用于解决具有不兼容客户的容量设施选址问题
An Enhanced Large Neighborhood Search Approach for the Capacitated Facility Location Problem with Incompatible Customers
AI总结:
针对具有客户不兼容约束的容量设施选址问题,提出一种结合混合破坏算子和精确修复的大邻域搜索方法,在所有基准实例上取得了新的最优解。
摘要:
文献中最近引入了一种经典容量设施选址问题的新变体,该变体考虑了客户之间的不兼容性。该问题捕捉了给定客户对不能由同一设施服务的情况。这一特征对于许多实际选址问题至关重要,例如存在危险或污染材料以及竞争客户之间的冲突。在本文中,我们提出了一种大邻域搜索(LNS)方法来解决该问题。在LNS框架内,我们引入了三种不同的破坏算子,并以混合方式组合它们,同时在修复阶段使用精确求解器。针对LNS的设计研究了不同的算法组件。实验分析表明,我们的新方法优于现有的最先进元启发式算法,为所有可用的基准实例提供了新的最佳解。
英文摘要:
A new variant of the classic capacitated facility location problem, which considers incompatibilities between customers, has recently been introduced in the literature. This problem captures the situation where given pairs of customers cannot be served by the same facility. Such a feature is crucial for many practical cases of location problems, such as the presence of hazardous or polluting materials and contention between competing costumers. In this paper, we propose a Large Neighborhood Search (LNS) method to solve this problem. Within the framework of LNS, we introduce three different destroy operators, which are combined in a hybrid manner, and we use an exact solver in the repair phase. Different algorithmic components are investigated for the design of LNS. The experimental analysis shows that our new method outperforms existing state-of-the-art metaheuristics, providing new best solutions for all available benchmark instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。