NDLI: Competitive decision algorithm for multidimensional knapsack problem

Content Provider	IEEE Xplore Digital Library
Author	Xiong Xiao-hua Ning Ai-bing Ma Liang Wang An-bao
Copyright Year	2009
Description	Author affiliation: College of Computer Science and Technology, Shanghai Second Polytechnic University, China, 201209 (Xiong Xiao-hua; Wang An-bao) \|\| School of Management, University of Shanghai for Science and Technology, China, 200093 (Ning Ai-bing; Ma Liang)
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.
Starting Page	161
Ending Page	167
File Size	220414
Page Count	7
File Format	PDF
ISBN	9781424439706
DOI	10.1109/ICMSE.2009.5317499
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-09-14
Publisher Place	Russia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Ant colony optimization Multidimensional systems Heuristic algorithms Decision making resources exchange rule Fasteners Linear programming competitive decision algorithm Genetic algorithms multidimensional knapsack problem competitive force function competitive decision equilibrium Simulated annealing decision function Resource management
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem

Ant colony global optimization for a class of two-layer linear programming problems

Simulated annealing ant colony algorithm for QAP

Ant algorithm for the multi-dimensional knapsack problem (2004)

Solving bicriterion optimization problems by parallel simulated annealing

Ant Colony Optimization for Rule Induction with Simulated Annealing for Terms Selection

Ant Colony Optimization for the Next Release Problem: A Comparative Study

Notice of RetractionCompetitive Decision Algorithm for 0-1 Multiple Knapsack Problem

Competitive Decision Algorithm for Multiple-Choice Knapsack Problem Based on Reduction

Competitive decision algorithm for multidimensional knapsack problem

Similar Documents

Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem

Ant colony global optimization for a class of two-layer linear programming problems

Simulated annealing ant colony algorithm for QAP

Ant algorithm for the multi-dimensional knapsack problem (2004)

Solving bicriterion optimization problems by parallel simulated annealing

Ant Colony Optimization for Rule Induction with Simulated Annealing for Terms Selection

Ant Colony Optimization for the Next Release Problem: A Comparative Study

Notice of RetractionCompetitive Decision Algorithm for 0-1 Multiple Knapsack Problem

Competitive Decision Algorithm for Multiple-Choice Knapsack Problem Based on Reduction

Competitive decision algorithm for multidimensional knapsack problem