Repository of University of Nova Gorica

Show document
A+ | A- | SLO | ENG

Title:Solving a new variant of the capacitated maximal covering location problem with fuzzy coverage area using metaheuristic approaches
Authors:Atta, Soumen (Author)
Sinha Mahapatra, Priya Ranjan (Author)
Mukhopadhyay, Anirban (Author)
Files:This document has no files. This document may have a phisical copy in the library of the organization, check the status via COBISS. Link is opened in a new window
Language:English
Work type:Not categorized (r6)
Tipology:1.01 - Original Scientific Article
Organization:UNG - University of Nova Gorica
Abstract:The Maximal Covering Location Problem (MCLP) is concerned with the optimal placement of a fixed number of facilities to cover the maximum number of customers. This article considers a new variant of MCLP where both the coverage radii of facilities and the distance between customer and facility are fuzzy. Moreover, the finite capacity of each facility is considered. We call this problem the capacitated MCLP with fuzzy coverage area (FCMCLP), and it is formulated as a 0–1 linear programming problem. In this article, two classical metaheuristics: particle swarm optimization, differential evolution, and two new-generation metaheuristics: artificial bee colony algorithm, firefly algorithm, are proposed for solving FCMCLP. Each of the customized metaheuristics utilizes a greedy deterministic heuristic to generate their initial populations. They also incorporate a local neighborhood search to improve their convergence rates. New instances of FCMCLP are generated from the traditional MCLP instances available in the literature, and IBM’s CPLEX solver is used to generate benchmark solutions. An experimental comparative study among the four customized metaheuristics is described in this article. The performances of the proposed metaheuristics are also compared with the benchmark solutions obtained from CPLEX.
Keywords:Facility Location Problem (FLP), Fuzzy Capacitated Maximal Covering Location Problem (FCMCLP), Particle Swarm Optimization (PSO), Differential Evolution (DE), Artificial Bee Colony (ABC), Firefly Algorithm (FA)
Year of publishing:2022
Number of pages:108315
Numbering:170, August
COBISS_ID:144448259 Link is opened in a new window
URN:URN:SI:UNG:REP:MQETYPIL
DOI:https://doi.org/10.1016/j.cie.2022.108315 Link is opened in a new window
License:CC BY-NC-ND 4.0
This work is available under this license: Creative Commons Attribution Non-Commercial No Derivatives 4.0 International
Views:139
Downloads:0
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Document is not linked to any category.
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.

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:Computers & Industrial Engineering
Shortened title:CAIE
Publisher:Elsevier
ISSN:1879-0550
Year of publishing:2022

Back