Stanimirović, Zorica An efficient genetic algorithm for the uncapacitated multiple allocation \(p\)-hub median problem. (English) Zbl 1190.90043 Control Cybern. 37, No. 3, 669-692 (2008). Summary: The Uncapacitated Multiple Allocation \(p\)-hub Median Problem (the UMApHMP) is considered. A new heuristic method based on a genetic algorithm approach (GA) for solving UMApHMP is proposed. The described GA uses binary representation of the solutions. Genetic operators which keep the feasibility of individuals in the population are designed and implemented. The mutation operator with frozen bits is used to increase the diversibility of the genetic material. The running time of the GA is improved by caching technique. Proposed GA approach is bench-marked on the well-known CAB and AP data sets and compared with the existing methods for solving the UMApHMP. Computational results show that the GA quickly reaches all previously known optimal solutions, and also gives results on large scale AP instances (up to \(n=200\), \(p=20\)) that were not considered in the literature so far. Cited in 2 Documents MSC: 90B18 Communication networks in operations research 90C59 Approximation methods and heuristics in mathematical programming 93A30 Mathematical modelling of systems (MSC2010) Keywords:\(p\)-hub problem; genetic algorithms; discrete location and assignment PDFBibTeX XMLCite \textit{Z. Stanimirović}, Control Cybern. 37, No. 3, 669--692 (2008; Zbl 1190.90043) Full Text: EuDML