Pasar al contenido principal

BUSQUEDA DE LA EFICIENCIA Y SOSTENIBILIDAD DE LAS DECISIONES PUBLICAS: UN ENFOQUE MULTICRITERIO

ECO2016-76567-C4-3-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2016
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE ZARAGOZA

Resultados relacionados

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

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

The rank pricing problem: Models and branch-and-cut algorithms

  • Calvete, H.I.
  • Domínguez, C.
  • Galé, C.
  • Labbé, M.
  • Marín, A.
One of the main concerns in management and economic planning is to sell the right product to the right customer for the right price. Companies in retail and manufacturing employ pricing strategies to maximize their revenues. The Rank Pricing Problem considers a unit-demand model with unlimited supply and uniform budgets in which customers have a rank-buying behavior. Under these assumptions, the problem is first analyzed from the perspective of bilevel pricing models and formulated as a non linear bilevel program with multiple independent followers. We also present a direct non linear single level formulation bearing in mind the aim of the problem. Two different linearizations of the models are carried out and two families of valid inequalities are obtained which, embedded in the formulations by implementing a branch-and-cut algorithm, allow us to tighten the upper bound given by the linear relaxation of the models. We also study the polyhedral structure of the models, taking advantage of the fact that a subset of their constraints constitutes a special case of the Set Packing Problem, and characterize all the clique facets. Besides, we develop a preprocessing procedure to reduce the size of the instances. Finally, we show the efficiency of the formulations, the branch-and-cut algorithms and the preprocessing through extensive computational experiments.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

A Partial Allocation Local Search Matheuristic for Solving the School Bus Routing Problem with Bus Stop Selection

  • Calvete, H.I.
  • Gale, C.
  • Iranzo, J.A.
  • Toth, P.
This paper addresses the school bus routing problem with bus stop selection, which jointly handles the problems of determining the set of bus stops to visit, allocating each student to one of these bus stops and computing the routes that visit the selected bus stops, so that the total routing cost is minimized and the walking distance of the students is limited by a given value. A fast and efficient matheuristic is developed based on an innovative approach that first partially allocates the students to a set of active stops that they can reach, and computes a set of routes that minimizes the routing cost. Then, a refining process is performed to complete the allocation and to adapt the routes until a feasible solution is obtained. The algorithm is tested on a set of benchmark instances. The computational results show the efficiency of the algorithm in terms of the quality of the solutions yielded and the computing time.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

A decision tool based on bilevel optimization for the allocation of water resources in a hierarchical system

  • Calvete, Herminia I.
  • Galé, Carmen
  • Iranzo, José A.
  • Mateo, Pedro M.
This paper addresses the optimal allocation of water among competing stakeholders during a finite planning horizon. We focus on those water systems where there are two levels of decision making organized according to a hierarchical framework. At the upper level, a central authority allocates water to demand points having regard to environmental and sustainability issues as well as balancing water users' supply/demand. At the lower level of the hierarchy, demand point managers allocate water to users prioritizing economic strategies. On the other hand, when it comes to allocating limited resources that affect public welfare, the authority in charge can also use different political instruments such as fees to influence the decisions made at those levels of decision making that are not directly within its competence. We propose a multiobjective multifollower bilevel optimization problem that aims to fulfill the central authority goals while including the reaction of the demand point managers in terms of optimization problems as constraints. Using the well-known Karush–Kuhn–Tucker approach, we transform the bilevel model into an equivalent multiobjective mixed-integer single-level model for which we provide tight big-M values. For the purpose of showing the versatility of the model, extensive computational experiments on a set of instances have been carried out. The results show that the optimization problem can be solved to optimality in small computing times using off-the-shelf mixed-integer solvers even for complex water systems and long planning periods. In addition, they illustrate the effect of imposing fees on the achievement of the central authority's objectives.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic

  • Calvete, H.I.
  • Galé, C.
  • Iranzo, J.A.
  • Toth, P.
The school bus routing problem (SBRP) involves interrelated decisions such as selecting the bus stops, allocating the students to the selected bus stops, and designing the routes for transporting the students to the school taking into account the bus capacity constraint, with the objective of minimizing the cost of the routes. This paper addresses the SBRP when the reaction of students to the selection of bus stops is taken into account, that is, when students are allowed to choose the selected bus stop that best suits them. A bilevel optimization model with multiple followers is formulated, and its transformation into a single-level mixed integer linear programming (MILP) model is proposed. A simple and effective metaheuristic algorithm is also developed to solve the problem. This algorithm involves solving four MILP problems at the beginning, which can be used to obtain tight upper bounds of the optimal solution. Extensive computational experiments on SBRP benchmark instances from the literature show the effectiveness of the proposed algorithm in terms of both the quality of the solution found and the required computing time.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences

  • Calvete, H.I.
  • Galé, C.
  • Iranzo, J.A.
  • Camacho-Vallejo, J.F.
  • Casas-Ramírez, M.S.
This paper addresses a generalized version of the facility location problem with customer preferences which includes an additional constraint on the number of customers which can be allocated to each facility. The model aims to minimize the total cost due to opening facilities and allocating customers while taking into account both customer preferences for the facilities and these cardinality constraints. First, two approaches to deal with this problem are proposed, which extend the single level and bilevel formulations of the problem in which customers are free to select their most preferred open facility. After analyzing the implications of assuming any of the two approaches, in this research, we adopt the approach based on the hierarchical character of the model which leads to the formulation of a bilevel optimization problem. Then, taking advantage of the characteristics of the lower level problem, a single level reformulation of the bilevel optimization model is developed based on duality theory which does not require the inclusion of additional binary variables. Finally, we develop a simple but effective matheuristic for solving the bilevel optimization problem whose general framework follows that of an evolutionary algorithm and exploits the bilevel structure of the model. The chromosome encoding pays attention to the upper level variables and controls the facilities which are open. Then, an optimization model is solved to allocate customers in accordance with their preferences and the availability of the open facilities. A computational experiment shows the effectiveness of the matheuristic in terms of the quality of the solutions yielded and the computing time.