EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

3851. Valid inequalities for the capacitated facility location problem with preference constraints

Invited abstract in session TA-61: Covering Location Problems, stream Locational Analysis.

Tuesday, 8:30-10:00
Room: S10 (building: 101)

Authors (first author is the speaker)

1. Sophia Wrede
RWTH Aachen University
2. Christina Büsing
Lehr- und Forschungsgebiet Kombinatorische Optimierung, RWTH Aachen University
3. Markus Leitner
Department of Operations Analytics, Vrije Universiteit Amsterdam

Abstract

In the classical capacitated facility location problem (CFLP), a set of facilities needs to be chosen in order to cover the demand of customers. Customers are assigned to any open facility such that the capacity of the facility is not exceeded and the total cost consisting of opening and assignment costs is minimised. However, in many real-world applications customers are not willing to travel to any open facility assigned to them but want to select an open facility according to their preferences. Such deviations can turn feasible solutions for the CFLP infeasible. The capacitated facility location problem with preference constraints (CFLP-PC) takes this behavior into account by assigning customers to their most preferred open facility.
In this talk, we focus on two types of cover-based inequalities for the CFLP-PC. The first type corresponds to the classical cover inequalities, which we strengthen by taking advantage of a specific structure arising from the combination of capacities and preference constraints. In the second inequality type, we make use of information on the set of open facilities that arises from covers. We discuss the complexity of the corresponding separation problems and evaluate the performance of the inequalities for two preference types in a computational study.

Keywords

Status: accepted


Back to the list of papers