A Cultural Algorithm for the Two Variable Integer Programming Problem
Keywords:
Cultural algorithm, Integer programming problem (IPP), Belief space, Genetic algorithm, Optimization
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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2012-01-15
Issue
Section
License
Copyright (c) 2012 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.