C. Domínguez Sánchez, J. D. Jaime Alcántara
In the Capacitated Facility Location Problem with Customer Preferences the aim is to open a set of facilities and allocate each customer to a facility minimizing the total cost of location plus allocation and maximizing the preferences of the customers in the allocation. There is a limited number of customers that can be allocated to each plant. In this setting, a decision rule must be taken to discern which customers are allocated to plants with high demand. Any solution with full plants can have customers that would have liked to be allocated to a different plant which is full.
We propose new decision criteria for the allocation based on the concept of stability. New formulations are proposed for each decision criteria, along with theoretical results designed to obtain compact and tighten them. Preliminary computational results showing the efficiency of the approach and the resultant stable solutions are provided and compared.
Keywords: Location with preferences, Capacitated Facility Location, Combinatorial Optimization, Matchings under preferences
Scheduled
Location (GELOCA4)
June 13, 2025 11:00 AM
Sala 3. Maria Rúbies Garrofé