Abstract

A specific implementation of cultural algorithm is presented here for solving the following two variable integer programming problem with n constraints: Maximize or Minimizeare signed integers. A cultural algorithm consists of a population component almost identical to that of the genetic algorithm and, in addition, a knowledge component called the belief space. As the integer programming problem is a constrained optimization problem, the constraints including nonnegativity and integer restrictions are availed as the knowledge component and used to build the belief space.

How to Cite
KUMAR RAMADOSS , I.K. GULAM MOHIDDIN , AJIT PAL SINGH, Senthil. A Cultural Algorithm for the Two Variable Integer Programming Problem. Global Journal of Computer Science and Technology, [S.l.], feb. 2012. ISSN 0975-4172. Available at: <https://computerresearch.org/index.php/computer/article/view/435>. Date accessed: 26 jan. 2021.