Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/2911
Title: A Hybrid Genetic Algorithm for Solving the Uncapacitated Multiple Allocation Hub Location Problem
Authors: Stanimirović, Zorica 
Đukić, Maja
Kratica, Jozef J
Affiliations: Numerical Mathematics and Optimization 
Keywords: Transportation and telecommunication networks;Genetic algorithms;Hub location problems;Combinatorial optimization;Metaheuristics
Issue Date: 2010
Rank: M33
Publisher: Chania
Related Publication(s): Proceedings of the Stochastic Modeling Techniques and Data Analysis International Conference - STMDA 2010
Conference: Stochastic Modeling Techniques and Data Analysis International Conference - STMDA (2010 ; Chania)
Abstract: 
In this paper, a hybrid genetic algorithm for solving the Uncapacitated Multiple Allocation Hub Location Problem is proposed. This NP-hard problem has significant application in designing modern transportation and telecommunication networks, such as road and railway systems, postal systems, systems of fast delivery, etc. In order to improve the efficiency, genetic algorithm is combined with the local search heuristic. The proposed hybrid method shows to be very successful in solving problems of large dimensions with up to n = 120 nodes. It is also tested on instances with n = 130 and n = 200 nodes for which no optimal solution is presented in the literature so far. Although the optimal solutions are not known, we believe that the proposed hybrid method provides high quality solutions on these problem instances unsolved to optimality before.
URI: https://research.matf.bg.ac.rs/handle/123456789/2911
Appears in Collections:Research outputs

Show full item record

Google ScholarTM

Check


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