登入選單
返回Google圖書搜尋
A Variable Neighborhood Search for the Robust Capacitated P-median Problem
註釋The capacitated p-median problem (CPMP) involves placing $p$ facilities in a network and assigning customer nodes to these facilities to satisfy all customer demands with minimal transportation costs. In practical applications, demand and distance parameters are often uncertain during the planning process, leading to infeasible or excessively costly solutions if these uncertainties are disregarded. This paper addresses the robust CPMP (RCPMP), which incorporates demand uncertainty into the problem using the robust optimization paradigm. We propose a general framework to model and solve the RCPMP, considering different polyhedral uncertainty sets, namely the cardinality-constrained and the knapsack sets. To solve these robust variants, we implement an efficient Variable Neighborhood Search (VNS) heuristic that incorporates state-of-the-art algorithms, parallelization techniques, and optimized data structures. Computational experiments using adapted benchmark instances with ...