EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

2471. Exact solution methods for the bi-objective p-median and p-dispersion problem

Invited abstract in session WC-37: Theory of Multiobjective Optimization, stream Multiobjective Optimization.

Wednesday, 12:30-14:00
Room: 33 (building: 306)

Authors (first author is the speaker)

1. Andreas Klose
Department of Mathematics, Aarhus University

Abstract

Given an undirected graph, the bi-objective p-median and p-dispersion problem is to select p vertices of the graph such that the weighted average distance of the graph's vertices to their nearest of the selected p vertices is minimized and the distance between any two of the p selected vertices is maximized. For computing the bi-objective problem's non-dominated set the "ε-constraint method" as well as the "hybrid weighted sum and ε-constraint method" seem to be suitable approaches. ε-constraints put on the dispersion objective may, however, be enforced in different ways. Additionally, also the remaining constraint system can be formulated quite differently. In this talk, we compare the performance of different implementations of the ε-constraint and hybrid method based on different model formulations and means to enforce the ε-constraint. It thereby seems that in particular the application of Benders' decomposition for solving the scalarized problems gives promising results.

Keywords

Status: accepted


Back to the list of papers