A differential evolution approach for solving integer programming problems

6Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Basic differential evolution (DE), a potential optimizer, is mainly used for dealing with problem having continuous variables. However, it is observed that many real-life problems occurring in different fields such as chemical engineering, computer science, and management science deal with integer variables. Such problems are known as integer programming problems (IPP) and require a suitable technique for their solution. In the present study, we propose some slight modifications in basic structure of DE and apply it for solving PP. The proposed algorithm is named differential evolution for IPP (DEIPP), and its performance is evaluated on a set of benchmark problems. It is observed that our suggested DEIPP is quite efficient for dealing with optimization problem having integer or discrete and binary variables.

Cite

CITATION STYLE

APA

Zaheer, H., & Pant, M. (2015). A differential evolution approach for solving integer programming problems. In Advances in Intelligent Systems and Computing (Vol. 336, pp. 409–420). Springer Verlag. https://doi.org/10.1007/978-81-322-2220-0_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free