Genetic algorithm for finding a good first integer solution for MILP
File(s)DTR03-4.pdf (130.97 KB)
Published version
Author(s)
Nieminen, Kimmo
Ruuth, Sampo
Maros, Istvan
Type
Report
Abstract
The paper proposes a genetic algorithm based method for nding a good rst integer solu-
tion to mixed integer programming problems (MILP). The objective value corresponding
to this solution can be used to e ciently prune the search tree in branch and bound type
algorithms for MILP. Some preliminary computational results are also presented which
support the view that this approach deserves some attention.
tion to mixed integer programming problems (MILP). The objective value corresponding
to this solution can be used to e ciently prune the search tree in branch and bound type
algorithms for MILP. Some preliminary computational results are also presented which
support the view that this approach deserves some attention.
Date Issued
2003-01-01
Citation
Departmental Technical Report: 03/4, 2003, pp.1-16
Publisher
Department of Computing, Imperial College London
Start Page
1
End Page
16
Journal / Book Title
Departmental Technical Report: 03/4
Copyright Statement
© 2003 The Author(s). This report is available open access under a CC-BY-NC-ND (https://creativecommons.org/licenses/by-nc-nd/4.0/)
Publication Status
Published
Article Number
03/4