Genetic algorithms with double strings for 0-1 programming problems

Abstract In this paper, genetic algorithms with double strings for 0–1 knapsack problems are first revisited together with some modifications and computational experiments. Then the genetic algorithms with double strings for 0–1 knapsack problems are extended to deal with more general 0–1 programming problems involving both positive and negative coefficients in the constraints. Especially, new decoding algorithms for double strings using reference solutions both without and with the reference solution updating procedure are proposed so that each of individuals is decoded to the corresponding feasible solution for the general 0–1 programming problems. The efficiency and effectiveness of the proposed methods are investigated by comparing them with a branch and bound method with respect to the accuracy of an approximate solution and the processing time through a number of numerical experiments.

[1]  Masatoshi Sakawa,et al.  Multiobjective fuzzy satisficing methods for 0-1 knapsack problems through genetic algorithms , 1997 .

[2]  M. Sakawa,et al.  Fuzzy programming for multiobjective 0–1 programming problems through revised genetic algorithms , 1997 .

[3]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Masahiro Inuiguchi,et al.  Fuzzy multiobjective combinatorial optimization through revised genetic algorithms , 1994 .

[6]  William Orchard-Hays,et al.  Advanced Linear-Programming Computing Techniques , 1968 .

[7]  Masatoshi Sakawa,et al.  Genetic Algorithms and Fuzzy Multiobjective Optimization , 2001 .

[8]  Masatoshi Sakawa,et al.  An interactive fuzzy satisficing method for multiobjective 0-1 programming problems with fuzzy numbers through genetic algorithms with double strings , 1998, Eur. J. Oper. Res..

[9]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

[10]  Richard Bellman,et al.  Decision-making in fuzzy environment , 2012 .

[11]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[12]  Masatoshi Sakawa,et al.  An Interactive Fuzzy Satisficing Method for Multiobjective Multidimensional 0-1 Knapsack Problems Through Genetic Algorithms , 1996, International Conference on Evolutionary Computation.

[13]  Masatoshi Sakawa,et al.  Fuzzy Sets and Interactive Multiobjective Optimization , 1993 .

[14]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[15]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[16]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[17]  Witold Pedrycz,et al.  Fuzzy evolutionary computation , 1997 .

[18]  Masatoshi Sakawa,et al.  Interactive Fuzzy Programming for Multiobjective 0–1 Programming Problems Through Genetic Algorithms with Double Strings , 1996 .

[19]  Masatoshi Sakawa,et al.  An Interactive Fuzzy Satisficing Method for Multiobjective 0-1 Programming Problems Through Revised Genetic Algorithms , 1995 .

[20]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[21]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .