Proposition of the Interactive Pareto Iterated Local Search Procedure - Elements and Initial Experiments

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The article presents an approach to interactively solve multi-objective optimization problems. While the identification of efficient solutions is supported by computational intelligence techniques on the basis of local search, the search is directed by partial preference information obtained from the decision maker. An application of the approach to biobjective portfolio optimization, modeled as the well-known knapsack problem, is reported, and experimental results are reported for benchmark instances taken from the literature. In brief, we obtain encouraging results that show the applicability of the approach to the described problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Proposition of the Interactive Pareto Iterated Local Search Procedure - Elements and Initial Experiments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proposition of the Interactive Pareto Iterated Local Search Procedure - Elements and Initial Experiments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proposition of the Interactive Pareto Iterated Local Search Procedure - Elements and Initial Experiments will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-141538

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.