Kit of Uniformly Deployed Sets for p-Location Problems
Open Access
- 23 May 2023
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 11 (11) , 2418
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
Funding Information
- Slovak Research and Development Agency (APVV-19-0441, VEGA 1/0216/21, VEGA 1/0077/22, VEGA 1/0654/22)
- Scientific Grant Agency of the Ministry of Education, Science, Research and Sport of the Slovak Republic and the Slovak Academy of Sciences (APVV-19-0441, VEGA 1/0216/21, VEGA 1/0077/22, VEGA 1/0654/22)
This publication has 23 references indexed in Scilit:
- A new compact formulation for the discrete p-dispersion problemEuropean Journal of Operational Research, 2017
- Self-Organizing Migrating Algorithm2016
- Ambulance location and relocation models in a crisisCentral European Journal of Operations Research, 2014
- Computational study of radial approach to public service system design with generalized utility2014
- Solving Large p-Median Problems with a Radius FormulationINFORMS Journal on Computing, 2011
- Improving emergency service in rural areas: a bi-objective covering location model for EMS systemsAnnals of Operations Research, 2011
- Computational study of large-scale p-Median problemsMathematical Programming, 2006
- A New Formulation and Resolution Method for the p-Center ProblemINFORMS Journal on Computing, 2004
- Ambulance location and relocation modelsEuropean Journal of Operational Research, 2003
- A Note on the McKay–Miller–Širáň GraphsJournal of Combinatorial Theory, Series B, 2001