| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kratica, Jozef | - |
| dc.contributor.author | Tošić, Dušan | - |
| dc.contributor.author | Filipović, Vladimir | - |
| dc.contributor.author | Ljubić, Ivana | - |
| dc.date.accessioned | 2020-07-03T09:58:06Z | - |
| dc.date.available | 2020-07-03T09:58:06Z | - |
| dc.date.issued | 2002 | - |
| dc.identifier.isbn | 978-1-4471-1101-6 | - |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/3733 | - |
| dc.description.abstract | In 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. | - |
| dc.publisher | Springer Link | - |
| dc.subject | Genetic Algorithm | Transportation Cost | Steiner Tree | Lagrangean Relaxation | Steiner Tree Problem | - |
| dc.title | A genetic algorithm for the uncapacitated network design problem | - |
| dc.type | Book Chapter | - |
| dc.relation.publication | Soft Computing and Industry - Recent Applications | - |
| dc.identifier.doi | 10.1007/978-1-4471-0123-9_28 | - |
| dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
| dc.relation.firstpage | 329 | - |
| dc.relation.lastpage | 338 | - |
| dc.description.rank | M14 | - |
| item.cerifentitytype | Publications | - |
| item.openairetype | Book Chapter | - |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| crisitem.author.orcid | 0000-0002-9752-0971 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.