Geodesic
An Efficient Genetic Algorithm for the Uncapacitated R-Allocation P-Hub Maximal Covering Problem
Yugoslav journal of operations research, Tome 28 (2018) no. 2, p. 201 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

This paper deals with the Uncapacitated r-allocation p-hub Maximal Covering Problem (UrApHMCP) with a binary coverage criterion. This problem consists of choosing p hub locations from a set of nodes so as to maximize the total demand covered under the r-allocation strategy. The general assumption is that the transportation between the non-hub nodes is possible only via hub nodes, while each non-hub node is assigned to at most r hubs. An integer linear programming formulation of the UrApHMCP is presented and tested within the framework of a commercial CPLEX solver. In order to solve the problem on large scale hub instances that cannot be handled by the CPLEX, a Genetic Algorithm (GA) is proposed. The results of computational experiments on standard p-hub benchmark instances with up to 200 nodes demonstrate efficiency and effectiveness of the proposed GA method.
Classification : 90B80, 90B10, 68T20
Mots-clés : p-hub Maximal Covering Problem, Binary Coverage, Heuristic, Genetic Algorithm 
@article{YJOR_2018_28_2_a3,
     author = {Olivera Jankovi\'c},
     title = {An {Efficient} {Genetic} {Algorithm} for the {Uncapacitated} $R${-Allocation} $P${-Hub} {Maximal} {Covering} {Problem}},
     journal = {Yugoslav journal of operations research},
     pages = {201 },
     publisher = {mathdoc},
     volume = {28},
     number = {2},
     year = {2018},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_2_a3/}
}
TY  - JOUR
AU  - Olivera Janković
TI  - An Efficient Genetic Algorithm for the Uncapacitated $R$-Allocation $P$-Hub Maximal Covering Problem
JO  - Yugoslav journal of operations research
PY  - 2018
SP  - 201 
VL  - 28
IS  - 2
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_2_a3/
LA  - en
ID  - YJOR_2018_28_2_a3
ER  - 
%0 Journal Article
%A Olivera Janković
%T An Efficient Genetic Algorithm for the Uncapacitated $R$-Allocation $P$-Hub Maximal Covering Problem
%J Yugoslav journal of operations research
%D 2018
%P 201 
%V 28
%N 2
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_2_a3/
%G en
%F YJOR_2018_28_2_a3
Olivera Janković. An Efficient Genetic Algorithm for the Uncapacitated $R$-Allocation $P$-Hub Maximal Covering Problem. Yugoslav journal of operations research, Tome 28 (2018) no. 2, p. 201 . https://geodesic-test.mathdoc.fr/item/YJOR_2018_28_2_a3/