Repository of University of Nova Gorica

Show document
A+ | A- | Help | SLO | ENG

Title:An improved harmony search algorithm using opposition-based learning and local search for solving the maximal covering location problem
Authors:ID Atta, Soumen (Author)
Files:.pdf An_improved_harmony_search_algorithm_using_opposition-based_learning_and_local_search_for_solving_the_maximal_covering_location_problem.pdf (2,69 MB)
MD5: CD9A2F7DF64168F8257DD1529CBFE93F
 
URL https://www.tandfonline.com/doi/pdf/10.1080/0305215X.2023.2244907
 
Language:English
Work type:Unknown
Typology:1.01 - Original Scientific Article
Organization:UNG - University of Nova Gorica
Abstract:In this article, an improved harmony search algorithm (IHSA) that utilizes opposition-based learning is presented for solving the maximal covering location problem (MCLP). The MCLP is a well-known facility location problem where a fixed number of facilities are opened at a given potential set of facility locations such that the sum of the demands of customers covered by the open facilities is maximized. Here, the performance of the harmony search algorithm (HSA) is improved by incorporating opposition-based learning that utilizes opposite, quasi-opposite and quasi-reflected numbers. Moreover, a local search heuristic is used to improve the performance of the HSA further. The proposed IHSA is employed to solve 83 real-world MCLP instances. The performance of the IHSA is compared with a Lagrangean/surrogate relaxation-based heuristic, a customized genetic algorithm with local refinement, and an improved chemical reaction optimization-based algorithm. The proposed IHSA is found to perform well in solving the MCLP instances.
Keywords:maximal covering location problem, harmony search algorithm, opposition-based learning, facility location problem, opposite number
Publication date:01.01.2023
Year of publishing:2023
Number of pages:str. 1-20
Numbering:Vol. , [article no.] ǂ
PID:20.500.12556/RUNG-8546-11e41eec-9e85-76ad-e540-841f0c573101 New window
COBISS.SI-ID:167173635 New window
ISSN:0305-215X
UDC:62
ISSN on article:0305-215X
eISSN:1029-0273
DOI:10.1080/0305215X.2023.2244907 New window
NUK URN:URN:SI:UNG:REP:L95WADDN
Publication date in RUNG:05.10.2023
Views:794
Downloads:7
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Engineering optimization
Shortened title:Eng. optim.
Publisher:Gordon and Breach.
ISSN:0305-215X
COBISS.SI-ID:10292229 New window

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Back