Akcije

Yugoslav Journal of Operations Research
kako citirati ovaj članak
podeli ovaj članak

Metrika

  • citati u SCIndeksu: 0
  • citati u CrossRef-u:0
  • citati u Google Scholaru:[]
  • posete u poslednjih 30 dana:0
  • preuzimanja u poslednjih 30 dana:0

Sadržaj

članak: 8 od 57  
Back povratak na rezultate
2018, vol. 28, br. 2, str. 201-218
An efficient genetic algorithm for the uncapacitated r-allocation p-hub maximal covering problem
(naslov ne postoji na srpskom)
Univerzitet u Beogradu, Matematički fakultet + Univerzitet u Kragujevcu, Ekonomski fakultet

e-adresajankovic.olivera@gmail.com
Ključne reči: p-hub Maximal Covering Problem; Binary Coverage; Heuristic; Genetic Algorithm
Sažetak
(ne postoji na srpskom)
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.

O članku

jezik rada: engleski
vrsta rada: neklasifikovan
DOI: 10.2298/YJOR170120011J
objavljen u SCIndeksu: 26.06.2018.

Povezani članci

Nema povezanih članaka