Authors: Filipović, Vladimir
Kratica, Jozef 
Tošić, Dušan
Dugošija, Đorđe
Title: GA inspired heuristic for uncapacitated single allocation hub location problem
Journal: Applications of Soft Computing
Series/Report no.: Advances in Intelligent and Soft Computing
Volume: 58
First page: 149
Last page: 158
Issue Date: 1-Jan-2009
ISBN: 978-3-540-89619-7
ISSN: 1867-5662
DOI: 10.1007/978-3-540-89619-7_15
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.
Publisher: Springer Link

Show full item record


checked on May 21, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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