1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/443
DC FieldValueLanguage
dc.contributor.authorMatić, Draganen_US
dc.contributor.authorFilipović, Vladimiren_US
dc.contributor.authorSavić, Aleksandaren_US
dc.contributor.authorStanimirović, Zoricaen_US
dc.date.accessioned2022-08-13T09:27:51Z-
dc.date.available2022-08-13T09:27:51Z-
dc.date.issued2011-12-01-
dc.identifier.issn14509628en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/443-
dc.description.abstractIn this paper we present a genetic algorithm (GA) for solving NP-hard Multiple Warehouse Layout Problem (MLWLP). New encoding scheme with ap- propriate objective functions is implemented. Specific representation and modified genetic operators keep individuals correct and help in restoring good genetic mate- rial and avoiding premature convergence in suboptimal solutions. The algorithm is tested on instances generated to simulate real life problems. Experimental results show that the algorithm reaches most of optimal solutions for problems containing up to 40 item types. The algorithm is successfully tested on large scale problem instances that can not be handled by CPLEX solver due to memory limits.en_US
dc.language.isoenen_US
dc.publisherKragujevac : Prirodno-matematički fakulteten_US
dc.relation.ispartofKragujevac Journal of Mathematicsen_US
dc.subjectDiscrete optimizationen_US
dc.subjectGenetic algorithmsen_US
dc.subjectWarehouse layouten_US
dc.titleA genetic algorithm for solving multiple warehouse layout problemen_US
dc.typeArticleen_US
dc.identifier.doi2-s2.0-84859050023-
dc.identifier.isi000213546500010-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84859050023-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn1450-9628en_US
dc.description.rankM51en_US
dc.relation.firstpage119en_US
dc.relation.lastpage138en_US
dc.relation.volume35en_US
dc.relation.issue1en_US
item.openairetypeArticle-
item.languageiso639-1en-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-5943-8037-
crisitem.author.orcid0009-0003-8568-4260-
crisitem.author.orcid0000-0001-5658-4111-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

11
checked on Oct 19, 2025

Page view(s)

12
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.