A fast and efficient discrete evolutionary algorithm for the uncapacitated facility location problem

被引:9
|
作者
Zhang, Fazhan [1 ]
He, Yichao [1 ]
Ouyang, Haibin [2 ]
Li, Wenben [1 ]
机构
[1] Hebei GEO Univ, Sch Informat Engn, Shijiazhuang 050031, Peoples R China
[2] Guangzhou Univ, Sch Mech & Elect Engn, Guangzhou 510006, Peoples R China
关键词
Evolutionary algorithm; Facility location problem; Optimization algorithm; One direction mutation operator; Redundant checking strategy; SWARM OPTIMIZATION ALGORITHM; ARTIFICIAL ALGAE ALGORITHM; BEE COLONY ALGORITHM; DIFFERENTIAL EVOLUTION; APPROXIMATION ALGORITHM; BOUND ALGORITHM; PLANT LOCATION; BINARY; SEARCH;
D O I
10.1016/j.eswa.2022.118978
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In order to solve the uncapacitated facility location problem (UFLP) quickly and effectively, an enhanced group theory-based optimization algorithm (EGTOA) is proposed in this paper. Firstly, a new local search operator, One Direction Mutation Operator, is proposed, which is suitable for solving UFLP. Secondly, a Redundant Checking Strategy is presented to further optimize the quality of feasible solutions. To verify the performance of EGTOA, 15 benchmark instances of UFLP is selected in OR-Library, the comparison results with the 16 existing algorithms show that the solution obtained by EGTOA is better than other algorithms, moreover its speed is much faster than state-of-the-art algorithms. These demonstrates that EGTOA is a fast and effective algorithm for solving UFLP.
引用
收藏
页数:14
相关论文
共 50 条