Differential evolution for a constrained combinatorial optimisation problem
by Marcus Randall
International Journal of Metaheuristics (IJMHEUR), Vol. 1, No. 4, 2011

Abstract: Differential evolution (DE) has been extensively applied to continuous problems, its mechanics naturally lending themselves to such. While some efforts have been made to adapt it to combinatorial problems, these have largely been problem specific and have not dealt extensively with constraint handling beyond penalty approaches. In this paper, a simple and generic strategy, relying on pre-developed heuristic units, is applied to DE and the generalised assignment problem. In addition, a simple, parameter-free approach to adapting control parameters is used. The results are competitive with other well established meta-heuristics. However, there is still scope for further improvement in the way that DE may be applied to constrained combinatorial optimisation.

Online publication date: Sat, 28-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com