Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

A Bilevel Approach to the Facility Location Problem with Customer Preferences Under a Mill Pricing Policy

  • Calvete, Herminia I.
  • Galé, Carmen
  • Hernández, Aitor
  • Iranzo, José A.
This paper addresses the facility location problem under a mill pricing policy, integrating customers’ behavior through the concept of preferences. The problem is modeled as a bilevel optimization problem, where the existence of ties in customers’ preferences can lead to an ill-posed bilevel problem due to the possible existence of multiple optima to the lower-level problem. As the commonly employed optimistic and pessimistic strategies are inadequate for this problem, a specific approach is proposed bearing in mind the customers’ rational behavior. In this work, we propose a novel formulation of the problem as a bilevel model in which each customer faces a lexicographic biobjective problem in which the preference is maximized and the total cost of accessing the selected facility is minimized. This allows for a more accurate representation of customer preferences and the resulting decisions regarding facility location and pricing. To address the complexities of this model, we apply duality theory to the lower-level problems and, ultimately, reformulate the bilevel problem as a single-level mixed-integer optimization problem. This reformulation incorporates big-M constants, for which we provide valid bounds to ensure computational tractability and solution quality. The computational study conducted allows us to assess, on the one hand, the effectiveness of the proposed reformulation to address the bilevel model and, on the other hand, the impact of the length of the customer preference lists and fixed opening cost for facilities on the computational time and the optimal solution.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

An iterated greedy‐based metaheuristic with local search for the rank pricing problem

  • Calvete, Herminia I.
  • Galé, Carmen
  • Hernández, Aitor
  • Iranzo, José A.
The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction phases. In this process, some components of a solution are removed, yielding partial solutions from which complete solutions are reconstructed. A local search method with three neighborhood exploration strategies is then applied. Computational experiments demonstrate the effectiveness of the proposed algorithm by comparing its performance with exact and heuristic methods from the literature. It consistently finds optimal or near‐optimal solutions for instances with known optima. For most cases where the optimal solution is unknown, the algorithm matches or outperforms the best‐known solutions. Moreover, it achieves these results with significantly lower computational times, reinforcing its suitability for solving the rank pricing problem.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

A novel approach to pessimistic bilevel problems. An application to the rank pricing problem with ties

  • Calvete, Herminia I.
  • Galé, Carmen
  • Hernández, Aitor
  • Iranzo, José A.
This paper introduces a novel method to address the pessimistic approach to the bilevel problem. It consists of considering a lexicographic biobjective optimization problem at the lower level. To emphasize the significance of this approach, we implement it in the context of the Rank Pricing Problem with Ties. This problem can be formulated as a bilevel problem that inherently demands the use of the pessimistic approach. Considering the properties of the lexicographic biobjective problem involved, we formulate this problem as a single level mixed integer optimization problem, deriving also valid values for the big-Ms involved and valid inequalities for this formulation. The computational experiment carried out confirms the relevance of the proposed method.