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/666
DC FieldValueLanguage
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorTošic, Dušanen_US
dc.contributor.authorFilipović, Vladimiren_US
dc.contributor.authorLjubić, Ivanaen_US
dc.date.accessioned2022-08-14T09:49:35Z-
dc.date.available2022-08-14T09:49:35Z-
dc.date.issued2001-01-01-
dc.identifier.issn03990559en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/666-
dc.description.abstractThe simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms. © EDP Sciences 2001.en
dc.relation.ispartofRAIRO - Operations Researchen
dc.subjectCombinatorial optimizationen
dc.subjectGenetic algorithmsen
dc.subjectSimple plant location problemen
dc.titleSolving the simple plant location problem by genetic algorithmen_US
dc.typeArticleen_US
dc.identifier.doi10.1051/ro:2001107-
dc.identifier.scopus2-s2.0-0034970081-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0034970081-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.firstpage127en
dc.relation.lastpage142en
dc.relation.volume35en
dc.relation.issue1en
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0002-5943-8037-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

138
checked on Mar 6, 2025

Page view(s)

22
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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