Kit of Uniformly Deployed Sets for p -Location Problems

Jaroslav Janáček, Marek Kvet () and Peter Czimmermann
Additional contact information
Jaroslav Janáček: Faculty of Management Science and Informatics, University of Žilina, Univerzitná 8215/1, 010 26 Žilina, Slovakia
Marek Kvet: Faculty of Management Science and Informatics, University of Žilina, Univerzitná 8215/1, 010 26 Žilina, Slovakia
Peter Czimmermann: Faculty of Management Science and Informatics, University of Žilina, Univerzitná 8215/1, 010 26 Žilina, Slovakia

Mathematics, 2023, vol. 11, issue 11, 1-14

Abstract: This paper deals with p -location problem solving processes based on a decomposition, which separates the creation of a uniformly deployed set of p -location problems from the solution of the p -location problem for that specific instance. The research presented in this paper is focused on methods of construction of uniformly deployed sets of solutions and the examination of their impact on the efficiency of subsequent optimization algorithms. The approaches to the construction are used for the constitution of predetermined families of uniformly deployed sets of p -location problem solutions, which have standard sizes. We introduce two methods of uniformly deployed set construction: the first one is based on composition, followed by an enlargement process; and the second one makes use of voltage graphs. The construction approaches are completed by an algorithm, which adjusts the set of solutions to the sizes of a solved instance. The influence of a set construction approach on solving process efficiency is studied on real-world benchmarks, which include both the p -median objective function and the generalized disutility function. The solving process is performed alternatively using the swap or path-relinking based methods. Results of the computational study obtained by all combinations of the mentioned approaches are presented and evaluated in the concluding part of the paper to make the studied characteristics visible.

Keywords: discrete optimization; p -location problems; uniformly deployed sets (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/11/2418/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/11/2418/ (text/html)

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:gam:jmathe:v:11:y:2023:i:11:p:2418-:d:1153847

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().