Year: 2026
Type: article
Abstract: Presents a new series of test instances designed to test algorithms for solving the robust 𝑝-median problem. The classical 𝑝-median problem is a fundamental problem of facility location. The goal of the median problem is to select points from a variety of possible locations, minimizing the total cost of customer service. The robust version of this problem extends the classical formulation, taking into account the uncertainty in customer demand (weight). Unlike the deterministic case, customer demand can change over time. The essence of the task is to maximize the resilience of the solution to data changes. The new formulation requires the development of original algorithms. To test them, a series of test cases of various structures and dimensions was created. Based on these series, an experimental study of the proposed and known algorithms has been conducted. The article describes the rules for constructing a series of test cases, provides and analyzes the results of computational experiments.
Source: Herald of Omsk University
Author: Ivan S. Khmara
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: hybrid
Award: G674060982
OpenAlex ID: W7203882308
