混合遗传算法求解应急抢修点选址问题

摘要

考虑设备应急抢修的时限要求和整个应急抢修系统的服务质量要求,采用0-1整数规划模型描述了应急抢修点选址问题,并针对该问题设计了一种混合遗传算法.在算法中使用启发式算法对种群中的不可行解进行修复,以保持种群在可行域内搜索,并采用近邻搜索算法改善种群中的最佳个体.算例计算的结果表明,该算法求得的结果要优于基于罚函数的遗传算法和采用简单修复算法的遗传算法.%This paper concerned the timeliness requirement of emergency repair and the service quality of emergency repair system, and characterized emergency repair station location problem by a 0-1 integer programing. It proposed a hybrid genetic algorithm in which repaired the infeasible solutions by heuristic algorithms to keep population exploring in feasible region, and used a neighbor search algorithm to improve the best individual in population. Computational experiments show the proposed algorithm is better than the genetic algorithms based on penalty function and straightforward infeasible solution repair.