Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1315
DC FieldValueLanguage
dc.contributor.authorDjukanović, Markoen_US
dc.contributor.authorKartelj, Aleksandaren_US
dc.contributor.authorBlum, Christianen_US
dc.date.accessioned2024-07-10T14:08:11Z-
dc.date.available2024-07-10T14:08:11Z-
dc.date.issued2023-12-01-
dc.identifier.issn09574174-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/1315-
dc.descriptionCopyright by Elsevier DOI: https://doi.org/10.1016/j.eswa.2023.120762en_US
dc.description.abstractThe multidimensional multi-way number partitioning problem takes as input a set of n vectors with a fixed dimension m≥2, and aims to find a partitioning of this set into k≥2 non-empty subsets, such that the sums per coordinate across all subsets are as similar as possible. The problem has applications in key encryption, multiprocessor scheduling, minimization of circuit size and delay, and clustering. This paper employs a hybrid meta-heuristic, a self-adaptive version of the Construct, Merge, Solve, and Adapt algorithm equipped with an efficient local search procedure. Local search was able to accelerate the convergence towards promising regions of the search space. A comprehensive experimental evaluation shows that the proposed algorithm improves over all four competing algorithms from the related literature, especially when it comes to instances with higher k-values, i.e. k≥3. The observed average relative differences are for several instance groups larger than 25% in favor of the proposed algorithm compared to the second-best approach. In fact, a statistical evaluation indicates that our algorithm performs significantly better than the other approaches on all instances with k≥3.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofExpert Systems with Applicationsen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectHybrid metaheuristicsen_US
dc.subjectLocal searchen_US
dc.subjectMILP modelsen_US
dc.subjectNumber partitioning problemen_US
dc.titleSelf-adaptive CMSA for solving the multidimensional multi-way number partitioning problemen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.eswa.2023.120762-
dc.identifier.scopus2-s2.0-85163486446-
dc.identifier.isi001053872700001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85163486446-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn0957-4174en_US
dc.description.rankM21aen_US
dc.relation.firstpageArticle no. 120762en_US
dc.relation.volume232en_US
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextembargo_20260101-
item.openairetypeArticle-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-9839-6039-
Appears in Collections:Research outputs
Files in This Item:
File Description SizeFormat Existing users please
djukanovic_kartelj_clean_version__ESWA.pdf611.36 kBAdobe PDF
Embargoed until January 1, 2026    Request a copy
Show simple item record

SCOPUSTM   
Citations

3
checked on Dec 21, 2024

Page view(s)

25
checked on Dec 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons