Scaling-up many-objective combinatorial optimization with Cartesian products of scalarization functions

Mădălina M. Drugan ()
Additional contact information
Mădălina M. Drugan: Vrije Universiteit Brussel

Journal of Heuristics, 2018, vol. 24, issue 2, No 2, 135-172

Abstract: Abstract The trade-off between the exploration of large size neighborhoods and the exploitation of Pareto fronts with high cardinality is a challenging task for the metaheuristics for many-objective combinatorial optimization problems. Cartesian products of scalarization functions, or simpler, Cartesian scalarization, is a novel technique that simplifies the search by reducing the number of objectives using sets of scalarization functions. Cartesian scalarization is an alternative to scalarization functions that scales up the local search for many-objective spaces. We introduce a method that automatically generates Cartesian scalarization functions; we use combinatorics to analyze the properties of Cartesian scalarization functions. Cartesian scalarization local search (CsLs) uses a set of Cartesian scalarization functions to generate a quality Pareto local front. We show that CsLs is a well-defined local search algorithm that converges to a Pareto local solution set in finite time. Cartesian scalarization outperforms other Pareto and scalarization local search methods on many-objective combinatorial optimization instances.

Keywords: Pareto local search; Many-objective optimization; Scalarization functions; Many-objectives combinatorial optimization problems (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10732-017-9361-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:24:y:2018:i:2:d:10.1007_s10732-017-9361-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-017-9361-x

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().