Abstract
The uncapacitated facility location problem (UFLP) is a well-known combinational optimization problem, attracting numerous heuristic and meta-heuristic methods. However, these effective algorithms still encounter challenges when solving large-scale UFLP instances. To deal with the thousands of decision variables, one possible approach is to predict and remove unimportant facilities and thus decreases the dimensionality of problem instances. This paper explores the problem reduction of large-scale instances of UFLP. We propose suitable features of facilities to construct machine learning models for UFLP by learning from small instances. Based on this model, we introduce a novel problem reduction strategy-based optimization framework, and apply it to large instances. Through comprehen-sive experiments, we show that the proposed problem reduction strategy can effectively transform the UFLP instances to smaller ones. The performance of existing solution methods can be significantly enhanced, especially on large-scale instances. Under the proposed framework, we also show the generalization abilities of our models, which can be improved further.
Original language | English |
---|---|
Number of pages | 8 |
DOIs | |
Publication status | E-pub ahead of print - 8 Aug 2024 |
Event | 13th IEEE Congress on Evolutionary Computation, CEC 2024 - Yokohama, Japan, Yokohama, Japan Duration: 30 Jun 2024 → 5 Jul 2024 |
Conference
Conference | 13th IEEE Congress on Evolutionary Computation, CEC 2024 |
---|---|
Country/Territory | Japan |
City | Yokohama |
Period | 30/06/24 → 5/07/24 |
Funding
This work was supported by the National Key R&D Program of China (Grant No. 2023YFE0106300), the National Natural Science Foundation of China (Grant No. 62250710682), the Guangdong Provincial Key Laboratory (Grant No. 2020B121201001), and the Program for Guangdong Introducing Innovative and Entrepreneurial Teams (Grant No.2017ZT07X386).