Comparison of local search-based metaheuristics on the multiple objective knapsack problem

• Autorzy: Jaszkiewicz, A.
• Języki publikacji: EN

Abstrakty

EN

The paper presents a comparative experiment with local search-based metaheuristics on the multiple objective knapsack problem. The methods used in this experiment are: Memetic-Pareto Archive Evolution Strategy (M-PAES), multiple objective genetic local search (MOGLS), Serafmi's multiple objective simulated annealing (SMOSA), multiple objective simulated annealing proposed by Ulungu et al. (MOSA) and Pareto simulated annealing (PSA). The experiment follows the design of the previous comparative studies in which M-PAES proved to be the best performer among several evolutionary algorithms. The results of the experiment reported in this paper indicate the best performance of MOGLS and PSA on the multiple objective knapsack problem.

Słowa kluczowe

EN

local search metaheuristic; multiple objective knapsack problem

• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 2001
• Tom: Vol. 26, No. 1
• Strony: 99-120
• Opis fizyczny: Bibliogr. 22 poz.

Twórcy

autor

Jaszkiewicz, A.

• Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 3a, 60-965 Poznań, Poland,