A Genetic Algorithm for the Multiple-Choice Integer Program

Atidel Ben Hadj-Alouane and James C. Bean
Additional contact information
Atidel Ben Hadj-Alouane: University of Michigan, Ann Arbor, Michigan
James C. Bean: University of Michigan, Ann Arbor, Michigan

Operations Research, 1997, vol. 45, issue 1, 92-101

Abstract: We present a genetic algorithm for the multiple-choice integer program that finds an optimal solution with probability one (though it is typically used as a heuristic). General constraints are relaxed by a nonlinear penalty function for which the corresponding dual problem has weak and strong duality. The relaxed problem is attacked by a genetic algorithm with solution representation special to the multiple-choice structure. Nontraditional reproduction, crossover and mutation operations are employed. Extensive computational tests for dual degenerate problem instances show that suboptimal solutions can be obtained with the genetic algorithm within running times that are shorter than those of the OSL optimization routine.

Keywords: programming-integer-heuristic; convergent genetic algorithm; programming-integer-theory; strong duality; computers/cs-artificial intelligence; genetic algorithms (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.45.1.92 (application/pdf)

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:inm:oropre:v:45:y:1997:i:1:p:92-101

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().