|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Genetic algorithm for solving uncapacitated multiple allocation hub location problem||Journal:||Computing and Informatics||Volume:||24||Issue:||4||First page:||415||Last page:||426||Issue Date:||1-Jan-2005||Rank:||M23||ISSN:||1335-9150||Abstract:||
Hub location problems are widely used for network designing. Many variations of these problems can be found in the literature. In this paper we deal with the uncapacitated multiple allocation hub location problem (UMAHLP). We propose a genetic algorithm (GA) for solving UMAHLP that uses binary encoding and genetic operators adapted to the problem. Overall performance of GA implementation is improved by caching technique, We present the results of our computational experience on standard ORLIB instances with up to 200 nodes. The results show that GA approach quickly reaches all optimal solutions that are known so far and also gives results on some large-scale instances that were unsolved before.
|Keywords:||Combinatorial optimization | Discrete location and assignment | Evolutionary computation | Genetic algorithms | Hub location problem | Network design||Publisher:||Slovak Academy of Sciences|
Show full item record
checked on Nov 27, 2022
checked on Nov 28, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.