Multi-objective memetic optimization for the bi-objective obnoxious p-median problem.
Knowl.-Based Syst.(2018)
摘要
Location problems have been studied extensively in the optimization literature, the p-median being probably one of the most tackled models. The obnoxious p-median is an interesting variant that appears in the context of hazardous location. The aim of this paper is to formally introduce a bi-objective optimization model for this problem, in which a solution consists of a set of p locations, and two conflicting objectives arise. On the one hand, the sum of the minimum distance between each client and their nearest open facility and, on the other hand, the dispersion among facilities. Both objective values should be kept as large as possible for a convenient location of dangerous facilities.
更多查看译文
关键词
Memetic algorithms,Local search,Multi-objective optimization,Combinatorial problems,Obnoxious p-median
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络