Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://scidar.kg.ac.rs/handle/123456789/8548
Пун извештај метаподатака
Поље DC-а | Вредност | Језик |
---|---|---|
dc.rights.license | BY-NC-ND | - |
dc.contributor.author | Jankovic, Olivera | - |
dc.date.accessioned | 2020-09-19T16:03:20Z | - |
dc.date.available | 2020-09-19T16:03:20Z | - |
dc.date.issued | 2018 | - |
dc.identifier.issn | 0354-0243 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/8548 | - |
dc.description.abstract | © 2018 Faculty of Organizational Sciences, Belgrade. All Rights Reserved. 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. | - |
dc.rights | openAccess | - |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.source | Yugoslav Journal of Operations Research | - |
dc.title | An efficient genetic algorithm for the uncapacitated R-allocation P-hub maximal covering problem | - |
dc.type | article | - |
dc.identifier.doi | 10.2298/YJOR170120011J | - |
dc.identifier.scopus | 2-s2.0-85049148283 | - |
Налази се у колекцијама: | Faculty of Economics, Kragujevac |
Датотеке у овој ставци:
Датотека | Опис | Величина | Формат | |
---|---|---|---|---|
10.2298-YJOR170120011J.pdf | 166.53 kB | Adobe PDF | Погледајте |
Ова ставка је заштићена лиценцом Креативне заједнице