کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
477182 | 1446140 | 2009 | 9 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Improving benders decomposition using a genetic algorithm Improving benders decomposition using a genetic algorithm](/preview/png/477182.png)
We develop and investigate the performance of a hybrid solution framework for solving mixed-integer linear programming problems. Benders decomposition and a genetic algorithm are combined to develop a framework to compute feasible solutions. We decompose the problem into a master problem and a subproblem. A genetic algorithm along with a heuristic are used to obtain feasible solutions to the master problem, whereas the subproblem is solved to optimality using a linear programming solver. Over successive iterations the master problem is refined by adding cutting planes that are implied by the subproblem. We compare the performance of the approach against a standard Benders decomposition approach as well as against a stand-alone solver (Cplex) on MIPLIB test problems.
Journal: European Journal of Operational Research - Volume 199, Issue 1, 16 November 2009, Pages 89–97