Authors: Kratica, Jozef 
Stanimirović, Zorica
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Solving the uncapacitated multiple allocation p-hub center problem by genetic algorithm
Journal: Asia-Pacific Journal of Operational Research
Volume: 23
Issue: 4
First page: 425
Last page: 437
Issue Date: 1-Dec-2006
Rank: M23
ISSN: 0217-5959
DOI: 10.1142/S0217595906001042
In this paper we describe a genetic algorithm (GA) for the uncapacitated multiple allocation p-hub center problem (UMApHCP). Binary coding is used and genetic operators adapted to the problem are constructed and implemented in our GA. Computational results are presented for the standard hub instances from the literature. It can be seen that proposed GA approach reaches all solutions that are proved to be optimal so far. The solutions are obtained in a reasonable amount of computational time, even for problem instances of higher dimensions.
Keywords: Discrete location problems | Genetic algorithms | P-hub center problem
Publisher: World Scientific
Project: Serbian Ministry of Science and Ecology, Grant no. 144015G

Show full item record


checked on May 18, 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.