A genetic algorithm for subset sum problem

Neurocomputing

Volumn 57, Issue 1-4, 2004, Pages 463-468

  Wang, Rong Long ^a  

^a UNIVERSITY OF FUKUI   (Japan)

Author keywords

Crossover; Genetic algorithm; Mutation; Subset sum problem

Indexed keywords

COMPUTER SIMULATION; GENETIC ALGORITHMS; OPTIMAL SYSTEMS;

SUBSET SUM PROBLEM (SSP);

SET THEORY;

ARTICLE; CHROMOSOME ANALYSIS; CONTROLLED STUDY; CROSSING OVER; GENE MUTATION; GENETIC ALGORITHM; GENETIC SELECTION; GENETIC VARIABILITY; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROBABILITY; PROBLEM SOLVING; SIMULATION;

EID: 1542575990     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2003.12.003     Document Type: Article

References (10)

1. Caldas L.G. Norford L.K. A design optimization tool based on a genetic algorithm Automat. Constr. 11 2 2002 173-184
2. Dietrich B.L. Escudero L.F. Chance F. Efficient reformulation for 0-1 programs: methods and computational results Discrete Appl. Math. 42 2-3 1993 147-175
3. Garey M.R. Jonson D.S. Computers and Intractability: A guide to the Theory of NP-completeness 1979 WH. Freeman & Co San Francisco
4. Ghosh D. Chakravarti N. A competitive local search heuristic for the subset sum problem Comput. Oper. Res. 26 3 1999 271-279
5. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning 1989 Addison-Wesley Reading, MA
6. Holland J.H. Adaption in Natural and Artificial System 1975 MIT Press Cambridge, MA
7. Konheim A.G. Cryptography: A Primer 1981 Wiley New York
8. Martello S. Toth P. Knapsack Problems, Algorithms and Computer Implementations 1990 Wiley Chichester, West Sussex, England
9. Prasad K. Kelly J.S. NP-completeness of some problems concerning voting games Int. J. Game Theory 19 1990 1-9
10. Stinson D.R. An Introduction to the Design and Analysis of Algorithms 2nd Edition 1987 The Charles Babbage Research Center Winnipeg, Manitoba, Canada