Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/424
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Stanimirović, Zorica | en_US |
dc.contributor.author | Marić, Miroslav | en_US |
dc.contributor.author | Radojičić Matić, Nina | en_US |
dc.contributor.author | Bǒzović, Srdjan | en_US |
dc.date.accessioned | 2022-08-13T09:27:47Z | - |
dc.date.available | 2022-08-13T09:27:47Z | - |
dc.date.issued | 2014-01-01 | - |
dc.identifier.issn | 16833511 | en |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/424 | - |
dc.description.abstract | In this paper we consider a discrete Load Balance location problem (LOBA). We propose two efficient hybrid metaheuristic methods for solving the LOBA problem: a combination of reduced and standard variable neighborhood search methods (RVNS-VNS), and hybridization of genetic algorithm and VNS approach (GA-VNS). The proposed hybrid methods are first benchmarked and compared on existing test problems for the LOBA problem with up to 100 customers and potential suppliers. In order to test effectiveness of the proposed methods, we modify some large-scale instances from the literature with up to 402 customers and potential suppliers. Exhaustive computational experiments show that proposed hybrid methods quickly reach all known optimal solutions, and provide solutions on large-scale problem instances in short CPU times. Regarding solution quality and running times, we conclude that the proposed GA-VNS approach outperforms other considered methods for solving the LOBA problem. | en |
dc.relation.ispartof | Applied and Computational Mathematics | en |
dc.subject | Discrete location | en |
dc.subject | Genetic algorithm | en |
dc.subject | Load balancing | en |
dc.subject | Metaheuristic method | en |
dc.subject | Variable neighborhood Search | en |
dc.title | Two efficient hybrid metaheuristic methods for solving the load balance problem | en_US |
dc.type | Article | en_US |
dc.identifier.scopus | 2-s2.0-84983775931 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84983775931 | - |
dc.contributor.affiliation | Numerical Mathematics and Optimization | en_US |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.relation.firstpage | 332 | en |
dc.relation.lastpage | 349 | en |
dc.relation.volume | 13 | en |
dc.relation.issue | 3 | en |
item.fulltext | No Fulltext | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Numerical Mathematics and Optimization | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.orcid | 0000-0001-5658-4111 | - |
crisitem.author.orcid | 0000-0001-7446-0577 | - |
crisitem.author.orcid | 0000-0002-9968-948X | - |
Appears in Collections: | Research outputs |
SCOPUSTM
Citations
4
checked on Nov 8, 2024
Page view(s)
18
checked on Nov 15, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.