An Evolutionary Solver for Pure Integer Linear Programming
From MaRDI portal
Abstract: In this paper we introduce an evolutionary algorithm for the solution of linear integer programs. The strategy is based on the separation of the variables into the integer subset and the continuous subset; the integer variables are fixed by the evolutionary system, and the continuous ones are determined in function of them, by a linear program solver. We report results obtained for some standard benchmark problems, and compare them with those obtained by branch-and-bound. The performance of the evolutionary algorithm is promising. Good feasible solutions were generally obtained, and in some of the difficult benchmark tests it outperformed branch-and-bound.
Recommendations
- An evolutionary algorithm for polishing mixed integer programming solutions
- Problem solving of integer programming on the basis of genetic algorithms
- scientific article; zbMATH DE number 1754542
- An algorithm of internal feasible directions for linear integer programming
- A software for the integer linear programming
Cited in
(6)- Evolution and state-of-the-art in integer programming
- An evolutionary algorithm for polishing mixed integer programming solutions
- Problem solving of integer programming on the basis of genetic algorithms
- scientific article; zbMATH DE number 7266921 (Why is no real title available?)
- scientific article; zbMATH DE number 2219772 (Why is no real title available?)
- Evolutionary Optimization Method for Approximating the Solution Set Hull of Parametric Linear Systems
This page was built for publication: An Evolutionary Solver for Pure Integer Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550040)
