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

Description

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.

Period	20 Oct 2017
Event title	Recent Advances in Multi-Objective Optimization
Event type	Conference
Location	GermanyShow on map