Efficient heuristics for the obnoxious planar p-median problem with variable sizes

IF 7.2 1区计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Applied Soft Computing Pub Date : 2025-06-17 DOI:10.1016/j.asoc.2025.113401

Sergio Salazar , Oscar Cordón , J. Manuel Colmenar

{"title":"Efficient heuristics for the obnoxious planar p-median problem with variable sizes","authors":"Sergio Salazar , Oscar Cordón , J. Manuel Colmenar","doi":"10.1016/j.asoc.2025.113401","DOIUrl":null,"url":null,"abstract":"<div><div>The location of obnoxious facilities is an optimization problem with a large social impact. Specifically, the obnoxious facility location problem in the plane with variable sizes (OPPMVS) studies the location of facilities considering that the obnoxious effect is transmitted through the air and depends on the production or service of the facility. In this work, a memetic algorithm is proposed in which the generation of the initial population and the genetic operators have been specifically designed for the target problem. In this approximation of this continuous problem, competitive results have been obtained compared with the state-of-the-art. The proposal has been tested in 21 problem instances provided by the original authors, obtaining the best results in 14 of them with a total deviation of 0.07%. This performance is obtained in an average execution time of 22 s, which improves the best state-of-the-art algorithm by one order of magnitude. These results have been validated with statistical tests.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"181 ","pages":"Article 113401"},"PeriodicalIF":7.2000,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625007124","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}

引用次数: 0

Abstract

The location of obnoxious facilities is an optimization problem with a large social impact. Specifically, the obnoxious facility location problem in the plane with variable sizes (OPPMVS) studies the location of facilities considering that the obnoxious effect is transmitted through the air and depends on the production or service of the facility. In this work, a memetic algorithm is proposed in which the generation of the initial population and the genetic operators have been specifically designed for the target problem. In this approximation of this continuous problem, competitive results have been obtained compared with the state-of-the-art. The proposal has been tested in 21 problem instances provided by the original authors, obtaining the best results in 14 of them with a total deviation of 0.07%. This performance is obtained in an average execution time of 22 s, which improves the best state-of-the-art algorithm by one order of magnitude. These results have been validated with statistical tests.

查看原文本刊更多论文

可变尺寸平面p中值问题的高效启发式算法

恼人设施的选址是一个具有较大社会影响的优化问题。具体而言，变尺寸飞机上的讨厌设施选址问题（OPPMVS）考虑到讨厌效应是通过空气传播的，并且依赖于设施的生产或服务，研究设施的选址问题。在这项工作中，提出了一种模因算法，其中初始群体的产生和遗传算子已经专门为目标问题设计。在这个连续问题的近似中，与最先进的技术相比，获得了具有竞争力的结果。对原作者提供的21个问题实例进行了测试，其中14个得到了最佳结果，总偏差为0.07%。这种性能在平均22秒的执行时间内获得，这将最先进的算法提高了一个数量级。这些结果已经通过统计检验得到了验证。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Applied Soft Computing 工程技术-计算机：跨学科应用

CiteScore

15.80

自引率

6.90%

发文量

874

审稿时长

10.9 months

期刊介绍： Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.