|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem||Journal:||European Journal of Operational Research||Volume:||182||Issue:||1||First page:||15||Last page:||28||Issue Date:||1-Oct-2007||Rank:||M21||ISSN:||0377-2217||DOI:||10.1016/j.ejor.2006.06.056||Abstract:||
This 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.
|Keywords:||Evolutionary computations | Genetic algorithms | Location | p-Hub median problem | Single allocation||Publisher:||Elsevier||Project:||Serbian Ministry of Science and Ecology, Grant no. 144007|
Show full item record
checked on Sep 17, 2022
checked on Sep 15, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.