A distributed algorithm for 0-1 knapsack problem based on mobile agent

Proceedings - 8th International Conference on Intelligent Systems Design and Applications, ISDA 2008

Volumn 2, Issue , 2008, Pages 208-212

  Qiao, Shanping ^a   Wang, Shixian ^a   Lin, Yongzheng ^a   Zhao, Ling ^a  

^a UNIVERSITY OF JINAN   (China)

Author keywords

[No Author keywords available]

Indexed keywords

0-1 KNAPSACK PROBLEM; DISTRIBUTED ALGORITHM; DISTRIBUTED PROBLEMS; EXPERIMENT CONDITION; KNAPSACK PROBLEMS; MOBILE AGENT TECHNOLOGY; PARALLEL COMPUTER; PARALLEL-PROCESSING TECHNOLOGY; THEORY AND PRACTICE;

INDUSTRIAL RESEARCH; INTEGER PROGRAMMING; INTELLIGENT SYSTEMS; MOBILE AGENTS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; SYSTEMS ANALYSIS;

PARALLEL ALGORITHMS;

EID: 67449143500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISDA.2008.110     Document Type: Conference Paper

References (26)

1. DANTZIG G B. Discrete Variable Extremism Problems [J]. Operations Research, 1957, 5:266-277.
2. M R Garey, D S Johnson. Computers and intractability: A Guide to the Theory of NP-Completeness [M]. San Francisco: W H Freeman and Co, 1979.
3. B Chor, R L Rivest. A Knapsack-Type Public Key Cryptosystem Based on Arithmetic in Finite Fields [J]. IEEE Trans on Information Theory, 1988, 34(5):901-909.
4. Vincent Barichard, Jin-Kao Hao. Genetic Tabu Search for Multi-Objective Knapsack Problem [J]. Journal of Tsinghua Science and Technology, 2003,8(1):8-13.
5. ZHONG YANHUA, YU CHAOFAN. A Quantum Algorithm to Resolve the 0/1-kiapsack problem [J]. Control &Automation, 2006, 22(36):273-274,176.
6. Marchand H, Wolsey L A. The 0-1 Knapsack Problem with a Single Continuous Variable [J]. Mathematical Programming, 1999, 85(1):15-33.
7. Dawande M, Kalagnanam J, Keskinocak P, et al. Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions [J]. Journal of Combinatorial Optimization, 2000, 4(2):171-186.
8. Holland J. Adaptation in Natural and Artificial Systems. MI :Ann Arbor ,MI :University of Michigan Press ,1975 ; Cambridge ,MA :MIT Press ,1992.
9. Sakawa M, Kato K, Shibano T. An interactive fuzzy satisfying method for multi-objective multidimensional 0-1 knapsack problems through genetic algorithms. In:Proceedings of 1996 IEEE International Conference on Evolutionary Computation ,Piscataway ,NJ ,USA ,1996.
10. Sakawa M, Kato K. Genetic algorithms wit h double strings for 0-1 programming problems. European Journal of Operational Research, 2003, 144:581-597.
11. Bian R, Chen Z, Yuan Z. Improved Crossover Strategy of Genetic Algorithms and Analysis of It s Performance. In :Proceedings of the 3rd world congress on Intelligent Control and Automation, Hefei, P. R. China, 2000.
12. SHI Liang, DONG Huailin, WANG Beizhan, LONG Fei. Genetic Algorithm Based on Active Evolution for Large Scale 0-1 Knapsack Problem [J]. Computer Engineering, 2007, 33(13):31-33.
13. SHEN Xianjun, WANG Weiwu, ZHENG Bojin, LI Yuanxiang. Modified Particle Swarm Optimization for 0-1 Knapsack Problems [J]. Computer Engineering, 2006, 32(18):23-24, 38.
14. Han K H, Kim J H. Genetic Quantum Algorithm and Its Application to Combinatorial Optimization Problem [C]//Proceedings of the 2000 IEEE Congress on Evolutionary Computation, 2000:1 354-1360.
15. LI Qing-Hua, LI Ken-Li, JIANG Sheng-Yi, ZHANG Wei. An Optimal Parallel Algorithm for the Knapsack Problem [J]. Journal of Software, 2003, 14(5):891-896.
16. Ken-Li Li, Ren-Fa Li, Qing-Hua Li. Optimal Parallel Algorithm for the Knapsack Problem Without Memory Conflicts [J]. Journal of Computer Science and Technology,2004,19(6) : 760-768.
17. Lou D C, Chang C C. A Parallel Two-List Algorithm for the Knapsack Problem [J]. Parallel Computing, 1997, 22 (14) :1985-1996.
18. LIU Xiao-ling, LI Ken-li, ZHENG Guang-yong. Research on the Parallel Algorithm for the Knapsack Problem Based on Sampling and MIMD [J]. Computer Engineering & Science, 2006, 28(9):100-102.
19. DING Wei Qun, JI Yong Chang, and CHEN Guo Liang. A PARALLEL MERGING ALGORITHM BASED ON MPP [J]. Journal of Computer Research and Development, 1999, 36 (1):52-56.
20. QIN Ling, BAI Yun, ZHANG Chunfang, CHEN Ling. Ant Colony Algorithm for 0-1 Knapsack Problem [J]. Computer Engineering, 2006, 32(6):212-214.
21. Li Kenli1, Yao Fengjuan, Li Renfa1, and Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing [J]. Journal of Computer Research and Development, 2007, 44(6):1063-1070.
22. WANG Rong-bo, ZHOU Chang-le. The Study of Mogent(Mobile Agent):An Overview [J]. Application Research of Computers, 2001, 6:9-11.
23. Carl Hewitt.Viewing Control Structures As Patterns Of Passing Messages [J].Artificial Intelligence,1977,8(3).
24. Schroeppel R, Shamir A. A T=O(2n/2), S=O(2n/4) algorithm for certain NP-complete problems. SIAM Journal of Computing, 1981, 10(3):456-464.
25. Lou DC, Chang CC. A parallel two-list algorithm for the knapsack problem. Parallel Computing, 1997, 22:1985-1996.
26. DING Wei Qun, JI Yong Chang, and CHEN Guo Liang. A PARALLEL MERGING ALGORITHM BASED ON MPP [J]. Journal of Computer Research and Development, 1999, 36(1):52-56.