A Low-Order Knowledge-Based Algorithm (LOKBA) to Solve Binary Integer Programming Problems S. H. Pakzad-Moghadam
Mehrdad Shahmohammadi, Reza Ghodsi · 2012
In this paper a novel and very fast low order knowledge-based algorithm (called LOKBA) is presented to solve binary integer programming (BIP) problems. The factors in the objective function and the constraints of any BIP problem contains specific knowledge and information that can be used to better search the solution space of the problem. In this work many new definitions are introduced to elaborate on this information and extract necessary knowledge for creating and improving solutions. Found solutions are improved further and further until there is no new knowledge that can be extracted and there are no more possible improvements. The proposed algorithm has many major credentials. It produces promising results within amazingly short run times even for very large problems such as problems with one million variables. Also, it is extendable to solve integer programming and binary quadratic programming problems. Furthermore, it can be combined with heuristic or meta heuristic algorithms.