A hybrid approach for biobjective optimization

A large number of the real world planning problems which are today solved using Operations Research methods are actually multiobjective planning problems, but most of them are solved using singleobjective methods. The reason for converting, i.e. simplifying, multiobjective problems to singleobjectiv...

Full description

Saved in:
Bibliographic Details
Published in:Discrete optimization 2018-05, Vol.28, p.89-114
Main Authors: Stidsen, Thomas, Andersen, Kim Allan
Format: Article
Language:English
Subjects:
Biobjective optimization
Branch-and-cut algorithm
Mixed integer programming
Traveling salesman problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A large number of the real world planning problems which are today solved using Operations Research methods are actually multiobjective planning problems, but most of them are solved using singleobjective methods. The reason for converting, i.e. simplifying, multiobjective problems to singleobjective problems is that no standard multiobjective solvers exist and specialized algorithms need to be programmed from scratch. In this article we will present a hybrid approach, which operates both in decision space and in objective space. The approach enables massive efficient parallelization and can be used to a wide variety of biobjective Mixed Integer Programming models. We test the approach on the biobjective extension of the classic traveling salesman problem, on the standard datasets, and determine the full set of nondominated points. This has only been done once before (Florios and Mavrotas, 2014), and in our approach we do it in a fraction of the time.
ISSN:1572-5286
1873-636X
DOI:10.1016/j.disopt.2018.02.001