School of Economics and Management, Civil Aviation Flight University of China, Guanghan, China.
College of Management Science, Chengdu University of Technology, Chengdu, China.
PLoS One. 2024 Mar 15;19(3):e0297295. doi: 10.1371/journal.pone.0297295. eCollection 2024.
Stochastic and robust optimization approaches often result in sub-optimal solutions for the uncertain p-hub median problem when continuous design parameters are discretized to form different environmental scenarios. To solve this problem, this paper proposes a triangular fuzzy number model for the Non-Strict Uncapacitated Multi-Allocation p-hub Median Problem. To enhance the quality and the speed of optimization, a novel optimization approach, combining the triangular fuzzy number evaluation index with the Genetic-Tabu Search algorithm, is proposed. During the iterations of the Genetic-Tabu Search algorithm for finding the optimal solution, the fitness of fuzzy hub schemes is calculated by considering the relative positional relationships of triangular fuzzy number membership functions. This approach directly addresses the triangular fuzzy number model and ensures the integrity of information in the p-hub problem as much as possible. It is verified by the classic Civil Aeronautics Board and several self-constructed data sets. The results indicate that, compared to the traditional Genetic Algorithm and Tabu Search algorithm, the Genetic-Tabu Search algorithm reduces average computation time by 49.05% and 40.93%, respectively. Compared to traditional random, robust, and real-number-based optimization approaches, the proposed optimization approach reduces the total cost in uncertain environments by 1.47%, 2.80%, and 8.85%, respectively.
当连续设计参数被离散化以形成不同的环境场景时,随机和鲁棒优化方法通常会导致不确定 p 中心median 问题的次优解决方案。为了解决这个问题,本文提出了一种非严格无能力多分配 p 中心median 问题的三角模糊数模型。为了提高优化的质量和速度,提出了一种新的优化方法,将三角模糊数评价指标与遗传禁忌搜索算法相结合。在遗传禁忌搜索算法寻找最优解的迭代过程中,通过考虑三角模糊数隶属函数的相对位置关系来计算模糊枢纽方案的适应度。该方法直接针对三角模糊数模型,并尽可能完整地保留 p 枢纽问题中的信息。通过经典的民用航空局和几个自建数据集进行了验证。结果表明,与传统的遗传算法和禁忌搜索算法相比,遗传禁忌搜索算法分别将平均计算时间减少了 49.05%和 40.93%。与传统的随机、鲁棒和实数优化方法相比,所提出的优化方法在不确定环境下分别降低了总成本 1.47%、2.80%和 8.85%。