Towards Merging Binary Integer Programming Techniques with Genetic Algorithms

Reza Zamani

Advances in Operations Research, 2017, vol. 2017, 1-10

Abstract:

This paper presents a framework based on merging a binary integer programming technique with a genetic algorithm. The framework uses both lower and upper bounds to make the employed mathematical formulation of a problem as tight as possible. For problems whose optimal solutions cannot be obtained, precision is traded with speed through substituting the integrality constrains in a binary integer program with a penalty. In this way, instead of constraining a variable with binary restriction, is considered as real number between 0 and 1, with the penalty of , in which is a large number. Values not near to the boundary extremes of 0 and 1 make the component of large and are expected to be avoided implicitly. The nonbinary values are then converted to priorities, and a genetic algorithm can use these priorities to fill its initial pool for producing feasible solutions. The presented framework can be applied to many combinatorial optimization problems. Here, a procedure based on this framework has been applied to a scheduling problem, and the results of computational experiments have been discussed, emphasizing the knowledge generated and inefficiencies to be circumvented with this framework in future.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2017/7048042.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2017/7048042.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaor:7048042

DOI: 10.1155/2017/7048042

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().