DocumentCode :
1873638
Title :
Meta-RaPS with Path Relinking for the 0–1 multidimensional knapsack problem
Author :
Arin, Arif ; Rabadi, Ghaith
Author_Institution :
Dept. of Eng. Manage. & Syst. Eng., Old Dominion Univ., Norfolk, VA, USA
fYear :
2012
fDate :
6-8 Sept. 2012
Firstpage :
347
Lastpage :
352
Abstract :
The rapid increase of dimensions and complexity of real life problems makes it more difficult to find optimal solutions by traditional optimization methods. This challenge requires intelligent and sophisticated algorithms to make the right decisions given a set of inputs and a variety of possible actions. In the problem solving arena, this definition is transformed into the term of artificial intelligence. Artificial intelligence emerges in metaheuristics via memory and learning in algorithms. Many successful metaheuristics employ “intelligent” procedures to obtain high quality solutions for discrete optimization problems. To demonstrate the contribution of memory and learning into metaheuristics, Path Relinking will be incorporated into Meta-RaPS (Metaheuristic for Randomized Priority Search) which is classified as a memoryless metaheuristic. The 0-1 multidimensional knapsack problem will be used to evaluate the proposed algorithm.
Keywords :
artificial intelligence; knapsack problems; optimisation; Meta-RaPS; artificial intelligence; discrete optimization problems; intelligent algorithms; intelligent procedures; metaheuristics; multidimensional Knapsack problem; path relinking; Algorithm design and analysis; Classification algorithms; Educational institutions; Learning systems; Optimization; Single machine scheduling; 0–1 multidimensional knapsack problem; Meta-RaPS; Metaheuristics; memory; path relinking;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems (IS), 2012 6th IEEE International Conference
Conference_Location :
Sofia
Print_ISBN :
978-1-4673-2276-8
Type :
conf
DOI :
10.1109/IS.2012.6335159
Filename :
6335159
Link To Document :
بازگشت