Efficient incrementing heuristics for generalized p-location problems

Jaroslav Janáček () and Marek Kvet ()
Additional contact information
Jaroslav Janáček: University of Žilina
Marek Kvet: University of Žilina

Central European Journal of Operations Research, 2021, vol. 29, issue 3, No 13, 989-1000

Abstract: Abstract This paper studies effective solving techniques for large p-location problems, in which generalized disutility is applied to incorporate stochastic behavior of real service system. The concept of generalized disutility follows the idea that the nearest located service center may be temporarily unavailable at the moment of currently arisen demand and the demand is serviced from a more distant service center with given probability. The more complex approach to the real p-location asks for enormous computational time of exact solving tools and thus evokes the question whether the faster heuristics can compete with the exact approaches in accuracy of results obtained. To answer the question, two heuristics were proposed for the studied problem. The first of them is a common swap local search with the best-admissible strategy and the second is based on the path-relinking method. The both heuristics make use of so called uniformly deployed sets used for preliminary mapping of the feasible solutions to accelerate the performance of the heuristics. As uniformly deployed set construction can be done in two modes, the paper is also focused on finding the most effective combination of the mode and heuristic. A real case study was performed with seven road networks with number of nodes varying from 250 to 660. In addition, ten different families of uniformly deployed sets were generated for each network and mode. The results of the case study confirm that the suggested approaches are able to produce the solutions of the same quality as the exact approaches. Furthermore, the study indicates drawbacks, which can be met in connection with usage of specific combinations of heuristic and the mode of uniformly deployed set construction.

Keywords: p-location problem; Generalized disutility; Incrementing heuristics; Path-relinking method; Uniformly deployed set (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10100-020-00722-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:29:y:2021:i:3:d:10.1007_s10100-020-00722-5

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-020-00722-5

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from Springer, Slovak Society for Operations Research, Hungarian Operational Research Society, Czech Society for Operations Research, Österr. Gesellschaft für Operations Research (ÖGOR), Slovenian Society Informatika - Section for Operational Research, Croatian Operational Research Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().