A differential evolution-based memetic algorithm for project scheduling problems
by Xiaoning Shen; Min Zhang
International Journal of Innovative Computing and Applications (IJICA), Vol. 6, No. 3/4, 2015

Abstract: A differential evolution (DE)-based memetic algorithm (MA) for solving the project scheduling problem (PSP) is proposed. In order to balance the abilities of exploration and exploitation, the proposed DE-based MA (DEMA) combines the DE-based global search with a problem-specific local search operator. In particular, DEMA applies evolutionary search schemes of DE to explore the large search space, where an improved mutation strategy that both uses vector differences for perturbation and learns from the current best solution is adopted. Besides, to make DE suitable for solving PSP which is a combinational optimisation problem, a slackness method is designed to convert between discrete dedications in PSP and continuous vectors in DE. On the other hand, a local search with two neighbourhood structures is utilised to exploit the local information around current solutions so that the solution quality can be further improved. Simulation results on real-world PSP instances validate the superiority of DEMA over state-of-the-art search-based approaches and the effectiveness of new mechanisms designed in DEMA.

Online publication date: Wed, 11-Nov-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 Innovative Computing and Applications (IJICA):
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