Differential evolution algorithm with mixed strategy for single machine total weighted tardiness problem
by Jing Wang; Aihua Yin
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 11, No. 4, 2016

Abstract: In this paper, we present a differential evolution algorithm with mixed strategy to solve the single machine total weighted tardiness problem. A coding rule is developed to enable the continuous differential evolution algorithm to be applied to all classes of sequencing problems, and a mixed strategy with GOBL strategy and chaotic operator is embedded in the differential evolution algorithm. The computational results show that the differential evolution algorithm is able to find the optimal or best-known solutions on a range of widely used benchmarks from the OR library, and the mixed strategy is a significant help in improving the efficiency and quality of the algorithm, especially in the 100 job difficult instance.

Online publication date: Thu, 16-Feb-2017

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 Wireless and Mobile Computing (IJWMC):
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