Bi-objective branch-and-bound and its application to problems arising in logistics

Beschreibung

In this talk, we present a branch-and-bound framework for bi-objective integer optimization. It relies on the notion of lower and upper bound sets and it uses what we call objective space branching in combination with "standard" variable branching techniques. Furthermore, it exploits integer objective function values in the pruning phase. We illustrate its performance and we show how we adapt it to successfully solve several different (real world) optimization problems, such as a bi-objective orienteering problem, the green city hub location problem, a stochastic covering location problem arising in disaster relief applications, and the golf tourist problem.

Zeitraum	20 Okt. 2017
Ereignistitel	Recent Advances in Multi-Objective Optimization
Veranstaltungstyp	Konferenz
Ort	DeutschlandAuf Karte anzeigen