Title :
Competitive decision algorithm for multidimensional knapsack problem
Author :
Xiong, Xiao-Hua ; Ning, Ai-Bing ; Ma, Liang ; Wang, An-Bao
Author_Institution :
Coll. of Comput. Sci. & Technol., Shanghai Second Polytech. Univ., Shanghai, China
Abstract :
The multidimensional knapsack problem (MKP) is a classified NP-hard optimization problem, which is a generalisation of the 0-1 simple knapsack problem (KP). It consists in selecting a subset of given items in such a way that the total profit of the selected items is maximized while a set of knapsack constraints are satisfied.The MKP is resource allocation model that is one of the most well-known integer programming problems. It often appears in decision making and programming, resource distribution, loading, and so on. For solving this problem, many algorithms such as simulated annealing, genetic algorithm, ant colony algorithm, and other heuristic algorithms have been proposed by scholars. Based on some properties of multidimensional knapsack problem, a competitive decision algorithm (CDA) for MKP is proposed. Competitive decision algorithm is a new optimization algorithm based on the analysis of the mechanism of natural competitions and the principle of decision. It uses the characteristics that competition builds optimization and the result of competition hinges on decision. We use this algorithm to solve many test instances of multidimensional knapsack problems and computational result results in good performances.
Keywords :
decision making; decision theory; integer programming; knapsack problems; profitability; resource allocation; set theory; CDA; MKP; NP-hard optimization problem; ant colony algorithm; competitive decision making algorithm; genetic algorithm; heuristic algorithm; integer programming problem; item total profit maximization; multidimensional knapsack constraint problem; optimization algorithm; resource allocation model; resource distribution; resource loading; simulated annealing; subset selection; Algorithm design and analysis; Ant colony optimization; Decision making; Fasteners; Genetic algorithms; Heuristic algorithms; Linear programming; Multidimensional systems; Resource management; Simulated annealing; competitive decision algorithm; competitive decision equilibrium; competitive force function; decision function; multidimensional knapsack problem; resources exchange rule;
Conference_Titel :
Management Science and Engineering, 2009. ICMSE 2009. International Conference on
Conference_Location :
Moscow
Print_ISBN :
978-1-4244-3970-6
Electronic_ISBN :
978-1-4244-3971-3
DOI :
10.1109/ICMSE.2009.5317499