Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems

LNCS n°9346This paper deals with biobjective combinatorial optimization problems where both objectives are required to be well-balanced. Lorenz dominance is a refinement of the Pareto dominance that has been proposed in economics to measure the inequalities in income distributions. We consider in this work the problem of computing the Lorenz optimal solutions to combinatorial optimization problems where solutions are evaluated by a two-component vector. This setting can encompass fair optimization or robust optimization. The computation of Lorenz optimal solutions in biobjective combinatorial optimization is however challenging (it has been shown intractable and NP-hard on certain problems). Nevertheless, to our knowledge, very few works address this problem. We propose thus in this work new methods to generate Lorenz optimal solutions. More precisely, we consider the adaptation of the well-known two-phase method proposed in biobjective optimization for computing Pareto optimal solutions to the direct computing of Lorenz optimal solutions. We show that some properties of the Lorenz dominance can provide a more efficient variant of the two-phase method. The results of the new method are compared to state-of-the-art methods on various biobjective combinatorial optimization problems and we show that the new method is more efficient in a majority of cases.nonouirechercheInternationa

Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems

Knapsack problem, Multi-objective programming, Core, Exact algorithm,

What Foreclosed Homes Should a Municipality Purchase to Stabilize Vulnerable Neighborhoods?

Housing, Foreclosures, Multi-objective programming, Urban affairs, Affordable housing,

Hybrid Metaheuristics for Multi-objective combinatorial optimization

Many real-world optimization problems can be modelled as combinatorial optimization problems. Often, these problems are characterized by their large size and the presence of multiple, conflicting objectives. Despite progress in solving multi-objective combinatorial optimization problems exactly, the large size often means that heuristics are required for their solution in acceptable time. Since the middle of the nineties the trend is towards heuristics that “pick and choose” elements from several of the established metaheuristic schemes. Such hybrid approximation techniques may even combine exact and heuristic approaches. In this chapter we give an overview over approximation methods in multi-objective combinatorial optimization. We briefly summarize “classical” metaheuristics and focus on recent approaches, where metaheuristics are hybridized and/or combined with exact methods