Advertisement

Genetic Algorithms for Integer Programming

  • Masatoshi Sakawa
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 14)

Abstract

This chapter is the integer version of Chapter 3, and genetic algorithms with double strings (GADS) for 0–1 programming problems are extended to deal with integer 0–1 programming problems. New decoding algorithms for double strings using reference solutions with the reference solution updating procedure are proposed especially so that individuals are decoded to the corresponding feasible solution for integer programming problems. The chapter also includes several numerical experiments.

Keywords

Genetic Algorithm Integer Programming Reference Solution Knapsack Problem Decode Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Masatoshi Sakawa
    • 1
  1. 1.Department of Artificial Complex Systems Engineering, Graduate School of EngineeringHiroshima UniversityHigashi-HiroshimaJapan

Personalised recommendations