Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1257-1264

  Uyar, Şima ^a   Eryiǧit, Gülşen ^a  

^a ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Adaptive mutation; Genetic algorithms; Multi dimensional knapsack problem; Penalty based constraint handling

Indexed keywords

CONSTRAINT THEORY; GENES; GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING;

ADAPTIVE MUTATION; MULTI-DIMENSIONAL KNAPSACK PROBLEM; PENALTY-BASED CONSTRAINT HANDLING;

EVOLUTIONARY ALGORITHMS;

EID: 32444444616     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068214     Document Type: Conference Paper

References (25)

1. Baluja S., Caruana, R., "Removing the Genetics from the Standard Genetic Algorithm", in Proceedings of the 12th International Conference on Machine Learning, Morgan Kaufmann, pp. 38-46, 1995.
2. Beasley J. E., "OR-Library: distributing test problems by electronic mail", Journal of the Operational Research Society, Vol. 41:11, pp1069-1072, 1990.
3. Beasley J. E., OR Library, "http://www.brunel.ac.uk/depts/ma/research/jeb/info.html", 2004.
4. Chu P. C., Beasley J. E., "A Genetic Algorithm for the Multidimensional Knapsack Problem", Journal of Heuristics, Vol. 4, pp. 63-86, Kluwer, 1998.
5. Eiben A. E., Hinterding R., Michalewicz Z., "Parameter Control in Evolutionary Algorithms", IEEE Transactions on Evolutionary Computation, Vol, 3:2, pp. 124-141, 1999.
6. Gottlieb J., Evolutionary Algorithms for Constrained Optimization Problems, PhD Thesis, Technical University of Clausthal - Germany, 1999.
7. Gottlieb J., Raidl G. R., "Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem", in Proceedings of Artificial Evolution (EA99), 1999.
8. Gottlieb J., Raidl G. R., "The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search", in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2000.
9. Gottlieb J., "On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems", in Applications of Evolutionary Computing: Proceedings of EvoWorkshops 2001: EvoCOP, 2001.
10. Hearin Center for Enterprise Science, "http://hces.bus.olemiss.edu/tools.html", 2004.
11. Heitkoetter J., SAC-94 Suite of 0/1 Multiple-Knapsack Problems, "http://elib.zib.de/pub/Packages/mp-testdata/ip/sac94-suite/", 2004.
12. Hinterding R., "Mapping, Order-Independent Genes and The Knapsack Problem", in Proceedings of the 1st IEEE International Conference on Evolutionary Computation, 1994.
13. Hinterding R., "Representation, Constraint Satisfaction and The Knapsack Problem", in Proceedings of the IEEE International Conference on Evolutionary Computation, 1999.
14. Kellerer H., Pferschy U., Pisinger D., Knapsack Problems, Springer, 2004.
15. Khuri S., Baeck T., Heitkoetter J., "The Zero/One Multiple Knapsack Problem and Genetic Algorithms", in Proceedings of the ACM Symposium on Applied Computation, ACM Press, 1994.
16. Larranaga P., Lozano J. A., Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer, 2001.
17. Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs, Springer, 1999.
18. Pirkul H., "A Heuristic Solution Procedure for the Multiconstraint Zero-One Knapsack Problem", Naval Research Logistics, Vol. 34, pp. 161-172, 1987.
19. Raidl G. R., "An Improved Genetic Algorithm for the Multiconstrained 0-1 Knapsack Problem", in Proceedings of the 5th IEEE International Conference on Evolutionary Computation, 1998.
20. Raidl G. R., "Weight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem". in Proceedings of the IEEE Congress on Evolutionary Computation (CEC99), 1999.
21. Skiena S. S., "Who is Interested in Algorithms and Why? - Lessons from the Stony Brook Algorithms Repository", 2nd Workshop on Algorithm Engineering (WAE'98), pp. 204-212, 1998.
22. Skiena S. S., The Stony Brook Algorithms Repository, "http://www.cs.sunysb.edu/~algorith/", 2001.
23. Uyar A. S., Eryigit G., Sariel S., "An Adaptive Mutation Scheme in Genetic Algorithms Fastening Convergence to the Optimum", in Proceedings of 3rd APIS: Asian Pacific International Symposium on Information Technologies, 2004.
24. Uyar A. S., Sariel S., Eryigit G., "A Gene Based Adaptive Mutation Strategy for Genetic Algorithms", in Proceedings of GECCO 2004: Genetic and Evolutionary Computation Conference, 2004.
25. Vasquez M., Hao J. K., "A Hybrid Approach for the 0-1 Multidimensional Knapsack Problem", in Proceedings of the IJCAI, 2001.