부산대학교 도서관

The Rank Pricing Problem (RPP) is a challenging bilevel optimization problem with binary variables whose objective is to determine the optimal pricing strategy for a set of products to maximize the total benefit, given that customer preferences influence the price for each product. Traditional methods for solving RPP are based on exact approaches which may be computationally expensive. In contrast, this paper presents a novel approach utilizing Variable Neighborhood Search (VNS), a popular heuristic known for its effectiveness in solving combinatorial optimization problems. Our proposed VNS algorithm introduces problem-specific neighborhood operators designed to effectively explore the solution space of the RPP. Even though our methodology does not have optimality guarantees, our computational experiments show that it outperforms Mixed Integer Program solvers regarding solution quality and computational burden.