Learn More
In this article, the beam search approach is extended to mul-ticriteria combinatorial optimization, with particular emphasis on its application to bicriteria { 0,1} knapsack problems. The beam search uses several definitions of upper bounds of knapsack solutions as well as a new selection procedure based on-indicator that allows to discard uninteresting(More)
The-indicator subset selection selects a subset of a nondominated point set that is as close as possible to a reference point set with respect to the-indicator. This selection procedure is used by population-based heuristic approaches for multiobjective optimization problems. Given that this procedure is called very often during the run of the heuristic(More)
  • 1