Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence

References

• Aarts , E. and Lenstra , J. K. 1997 . Local Search in Combinatorial Optimization , New York : John Wiley and Sons .
   Google Scholar
• Ackley , D. 1987 . A Connectionist Machine for Genetic Hill Climbing , Boston : Kluwer Academic Publishers .
   Google Scholar
• Akcay , Y. , Li , H. and Xu Susan , H. 2007 . Greedy algorithm for the general multidimensional knapsack problem . Ann. Oper. Res. , 150 ( 1 ) : 17 – 29 . (doi:10.1007/s10479-006-0150-4)
   Web of Science ®Google Scholar
• Aoe , J. 1991 . Computer Algorithms – Key Search Strategies , Los Alamitos : IEEE Computer Society Press .
   Google Scholar
• J.E. Beasley, OR Library (2004). Available at http://www.brunel.ac.uk/depts/ma/research/jeb/info.html.
   Google Scholar
• Bledsoe , W. W. The Use of Biological Concepts in the Analytical Study of Systems . Paper Presented at the ORSA-TIMS National Meeting . San Francisco , CA .
   Google Scholar
• Box , G. E.P. 1957 . Evolutionary operation: A method for increasing industrial productivity . J. Roy. Stat. Soc. C , 6 ( 2 ) : 81 – 101 .
   Google Scholar
• Bremermann , H. J. 1962 . Self Organizing Systems , 93 – 106 . Washington , DC : Spartan Books .
   Google Scholar
• Chu , P. C. and Beasley , J. E. 1998 . A genetic algorithm for the multidimensional knapsack problem . J. Heuristics , 4 ( 1 ) : 63 – 86 . (doi:10.1023/A:1009642405419)
   Web of Science ®Google Scholar
• Davis , L. 1991 . Handbook of Genetic Algorithms , New York : Van Nostrand Reinhold .
   Google Scholar
• Fogel , L. J. , Owens , A. J. and Walsh , M. J. 1966 . Artificial Intelligence Through Simulated Evolution , New York : John Wiley .
   Google Scholar
• Freville , A. 2004 . The multidimensional 0–1 knapsack problem: An overview . Eur. J. Oper. Res. , 127 ( 1 ) : 1 – 21 . (doi:10.1016/S0377-2217(03)00274-1)
   Web of Science ®Google Scholar
• Friedman , G. J. 1959 . Digital simulation of an evolutionary process . General Systems Yearbook , 4 : 171 – 184 .
   Google Scholar
• Goldberg , D. E. 1989 . Genetic Algorithms in Search, Optimization and Machine Learning , Boston : Addison-Wesley .
   Google Scholar
• Green , C. J. 1967 . Two Algorithms for Solving the Independent Multidimensional Knapsack Problem , Pittsburgh , , PA, USA : Graduate School for Industrial Administration . Management Sciences Report 110, Carnegie Institute of Technology
   Google Scholar
• Hedar , A.-R. and Fukushima , M. 2006 . Directed evolutionary programming: Towards an improved performance of evolutionary programming . Proceedings of Congress on Evolutionary Computation, CEC2006, IEEE World Congress on Computational Intelligence . July 16–21 2006 , Vancouver , Canada. pp. 1521 – 1528 .
   Google Scholar
• Hoff , A. , Lokketangen , A. and Mittet , I. Genetic algorithms for 0/1 multidimensional Knapsack problems . Proceedings Norsk Informatikk Konferanse . October 15 , Alta . pp. 291 – 301 .
   Google Scholar
• Holland , J. H. 1962 . “ Concerning efficient adaptive systems ” . In Goldstein, Self Organizing Systems , Edited by: Yovits , M. C. and Jacobi , G. T. 215 – 230 . Washington , DC : Spartan Books .
   Google Scholar
• Holland , J. H. 1975 . Adaptation in Natural and Artificial Systems , Ann Arbor , MI : University of Michigan Press .
   Google Scholar
• Jonge , W. D. , Tanenbaum , A. S. and Reit , R. P. 1987 . Two access methods using compact binary trees . IEEE Trans. Software Eng. , 13 ( 7 ) : 799 – 809 . (doi:10.1109/TSE.1987.233491)
   Web of Science ®Google Scholar
• Kellerer , H. , Pferschy , U. and Pisinger , D. 2004 . Knapsack Problems , Berlin : Springer .
   Google Scholar
• Khuri , S. , Back , T. and Heitkotter , J. 1994 . The zero/one multiple Knapsack problem and genetic algorithms . Proceedings of the 1994 ACM symposium on Applied computing . March 6–8 1994 . pp. 188 – 193 . USA : San Jose state University .
   Google Scholar
• Knuth , D. E. 1973 . The Art of Computer Programming, Volume 3: Sorting and Searching , Reading , MA : Addison-Wesley .
   Google Scholar
• Loulou , R. and Michaelides , E. 1979 . New greedy-like heuristics for the multidimensional 0–1 knapsack problem . Oper. Res. , 27 ( 6 ) : 1101 – 1114 . (doi:10.1287/opre.27.6.1101)
   Web of Science ®Google Scholar
• Martello , S. , Pisinger , D. and Toth , P. 2000 . New trends in exact algorithms for the 0–1 Knapsack problem . Eur. J. Oper. Res. , 123 ( 2 ) : 325 – 332 . (doi:10.1016/S0377-2217(99)00260-X)
   Web of Science ®Google Scholar
• Mauldin , M. L. 1984 . Maintaining diversity in genetic search . Proceedings of the National Conference on Artificial Intelligence . August 6–10 1984 , Austin , TX . pp. 247 – 250 .
   Google Scholar
• Pirkul , H. 1987 . A heuristic solution procedure for the multiconstraint zero-one knapsack problem . Naval Res. Logist. , 34 : 161 – 172 . (doi:10.1002/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A)
   Web of Science ®Google Scholar
• Rechenberg , I. 1965 . “ Cybernetics Solution Path of an Experimental Problem (Royal Aircraft Establishment Translation No. 1122, B.F. Toms, Trans.) ” . Ministry of Aviation, Royal Aircraft Establishment, Farnborough Hants .
   Google Scholar
• Ronald , S. 1998 . Duplicate genotypes in a genetic algorithm . Proceedings of IEEE International Conference On Evolutionary Computation, IEEE World Congress on Computational Intelligence . May 4–9 1998 , Alaska . pp. 793 – 798 .
   Google Scholar
• Sakakura , Y. and Taniguchi , N. A fuzzy clustering based selection method to maintain diversity in genetic algorithms . IEEE Congress on Evolutionary Computation . July 16–21 , Vancouver , Canada. pp. 3007 – 3012 .
   Google Scholar
• Senju , S. and Toyoda , Y. 1968 . An approach to linear programming with 0–1 variables . Manage. Sci. , 15 ( 4 ) : 196 – 207 . (doi:10.1287/mnsc.15.4.B196)
   Web of Science ®Google Scholar
• Shaefer , C. The ARGOT strategy: Adaptive representative genetic optimizer technique . Genetic Algorithms and their Applications: Proceedings of the Second International Conference . June , Washington, DC , USA. pp. 25 – 29 .
   Google Scholar
• Shih , W. 1979 . A branch and bound method for the multiconstraint zero–one knapsack problem . J. Oper. Res. Soc. , 30 ( 4 ) : 369 – 378 .
   Web of Science ®Google Scholar
• Uyar , A. S. and Eryigit , G. Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach . Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) . June , Washington, DC , USA. pp. 25 – 29 .
   Google Scholar
• Vasquez , M. and Hao , J. K. A hybrid approach for the 0/1 multidimensional knapsack problem . Proceedings of the 17th International Joint Conference on Artificial Intelligence . August 4–10 , Seattle , USA. pp. 328 – 333 .
   Google Scholar
• Whitley , D. and Starkweather , T. 1990 . GENITOR II: A distributed genetic algorithm . Exp. Theor. Artif. Intel. , : 189 – 214 . (doi:10.1080/09528139008953723)
   Google Scholar
• Whitley , D. , Rana , S. and Heckendron , R. 1997 . “ Representative issues in neighborhood search and evolutionary algorithms ” . In Genetic Algorithms in Engineering and Computer Science , Edited by: Quagliarelli , D. , Periaux , J. , Poloni , C. and Winter , G. 39 – 57 . New York : John Wiley and Sons .
   Google Scholar