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/416
DC FieldValueLanguage
dc.contributor.authorKratica, Jozefen_US
dc.contributor.authorStanimirović, Zoricaen_US
dc.contributor.authorTošić, Dušanen_US
dc.contributor.authorFilipović, Vladimiren_US
dc.date.accessioned2022-08-13T09:27:46Z-
dc.date.available2022-08-13T09:27:46Z-
dc.date.issued2007-10-01-
dc.identifier.issn03772217en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/416-
dc.description.abstractThis paper deals with the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP). Two genetic algorithm (GA) approaches are proposed for solving this NP-hard problem. New encoding schemes are implemented with appropriate objective functions. Both approaches keep the feasibility of individuals by using specific representation and modified genetic operators. The numerical experiments were carried out on the standard ORLIB hub data set. Both methods proved to be robust and efficient in solving USApHMP with up to 200 nodes and 20 hubs. The second GA approach achieves all previously known optimal solutions and achieves the best-known solutions on large-scale instances. © 2006 Elsevier B.V. All rights reserved.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofEuropean Journal of Operational Researchen_US
dc.subjectEvolutionary computationsen_US
dc.subjectGenetic algorithmsen_US
dc.subjectLocationen_US
dc.subjectp-Hub median problemen_US
dc.subjectSingle allocationen_US
dc.titleTwo genetic algorithms for solving the uncapacitated single allocation p-hub median problemen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.ejor.2006.06.056-
dc.identifier.scopus2-s2.0-34147154835-
dc.identifier.isi000246406000002-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/34147154835-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn0377-2217en_US
dc.description.rankM21en_US
dc.relation.firstpage15en_US
dc.relation.lastpage28en_US
dc.relation.volume182en_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.deptNumerical Mathematics and Optimization-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-5658-4111-
crisitem.author.orcid0000-0002-5943-8037-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

116
checked on Dec 10, 2025

Page view(s)

17
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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