Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/676
Title: | GA inspired heuristic for uncapacitated single allocation hub location problem | Authors: | Filipović, Vladimir Kratica, Jozef Tošić, Dušan Dugošija, Djordje |
Affiliations: | Informatics and Computer Science | Issue Date: | 1-Jan-2009 | Related Publication(s): | Applications of Soft Computing, World Soft Computing (WSC) Conference 2008 | Journal: | Advances in Intelligent and Soft Computing | Abstract: | In this article, the results achieved by applying GA-inspired heuristic on Uncapacitated Single Allocation Hub Location Problem (USAHLP) are discussed. Encoding scheme with two parts is implemented, with appropriate objective functions and modified genetic operators. The article presents several computational tests which have been conducted with ORLIB instances. Procedures described in related work round distance matrix elements to few digits, so rounding error is significant. Due to this fact, we developed exact total enumeration method for solving subproblem with fixed hubs, named Hub Median Single Allocation Problem (HMSAP). Computational tests demonstrate that GA-inspired heuristic reach all best solutions for USAHLP that are previously obtained and verified branch-and-bound method for HMSAP. Proposed heuristic successfully solved some instances that were unsolved before. © Springer-Verlag Berlin Heidelberg 2009. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/676 | ISBN: | 9783540896180 | ISSN: | 18675662 | DOI: | 10.1007/978-3-540-89619-7_15 |
Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
12
checked on Dec 20, 2024
Page view(s)
13
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.