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/3063
DC FieldValueLanguage
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorTošić, Dušanen_US
dc.contributor.authorFilipović, Vladimiren_US
dc.contributor.authorLjubić, Ivanaen_US
dc.date.accessioned2026-01-13T16:05:09Z-
dc.date.available2026-01-13T16:05:09Z-
dc.date.issued2002-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/3063-
dc.description.abstractIn this paper a genetic algorithm (GA) for solving the uncapacitated network design problem (UNDP) is presented. The problem with single source and destinations for each commodity is considered. UNDP is a base in class of the network design problems, but it is still NP-hard. The implementation of GA is additionally improved by caching technique of GA. The computational results on instances up to 50 commodities, 100 nodes and 700 edges are reported.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.titleA genetic algorithm for the uncapacitated network design problemen_US
dc.typeBook Parten_US
dc.relation.publicationSoft Computing and Industry - Recent Applicationsen_US
dc.identifier.doi10.1007/978-1-4471-0123-9_28-
dc.identifier.urlhttp://dx.doi.org/10.1007/978-1-4471-0123-9_28-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.isbn978-1-4471-1101-6en_US
dc.description.rankM14en_US
dc.relation.firstpage329en_US
dc.relation.lastpage336en_US
item.openairetypeBook Part-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
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

Google ScholarTM

Check

Altmetric

Altmetric


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