Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Similars in SciELO
Share
Computación y Sistemas
On-line version ISSN 2007-9737Print version ISSN 1405-5546
Abstract
PEREZ, Nancy; CUATE, Oliver; SCHUTZE, Oliver and ALVARADO, Alejandro. Including Users Preferences in the Decision Making for Discrete Many Objective Optimization Problems. Comp. y Sist. [online]. 2016, vol.20, n.4, pp.589-607. ISSN 2007-9737. https://doi.org/10.13053/cys-20-4-2501.
In many applications one is faced with the problem that many objectives have to be optimized concurrently leading to a many objective optimization problem (MaOP). One important characteristic of discrete MaOPs is that its solution set, the so-called Pareto set, consists of too many elements to be efficiently computed. Thus, though specialized evolutionary algorithms are in principle capable of computing a set S of well spread candidate solutions along the Pareto set, it is not guaranteed that the decision maker of the underlying problem will find the 'ideal' solution within S for his or her problem.
We argue in this paper that it makes sense to perform a kind of post-processing for a selected solution s ∈ S. More precisely, we will propose two different methods that allow to steer the search from s along the Pareto set into user specified directions. Numerical results on instances of the vehicle routing problem with time windows will show the effectivity of the novel methods.
Keywords : Many objective optimization; decision making; vehicle routing problem; discrete problem; evolutionary computation.