Peek – Shape – Grab: A methodology in three stages for approximating the non-dominated points of multiobjective discrete/combinatorial optimization problems with a multiobjective metaheuristic

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper discusses on the role of components of multiobjective metaheuristics in the context of multiobjective discrete/ combinatorial optimization. It suggests to separate in three stages the design of an operational solver for this class of optimization problems, featuring a methodology in this context. The arguments are illustrated using the knapsack problem as support, along numerical experiments.

Cite

CITATION STYLE

APA

Gandibleux, X. (2017). Peek – Shape – Grab: A methodology in three stages for approximating the non-dominated points of multiobjective discrete/combinatorial optimization problems with a multiobjective metaheuristic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10173 LNCS, pp. 221–235). Springer Verlag. https://doi.org/10.1007/978-3-319-54157-0_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free