Hybrid Simulated Annealing in Flow Shop Scheduling: a diversification and intensification approach

Nader Azizi, Ming Liang and Saeed Zolfaghari

International Journal of Industrial and Systems Engineering, 2009, vol. 4, issue 3, 326-348

Abstract: In the last few decades, several effective algorithms to solve combinatorial problems have been proposed. However, the challenging nature of these problems restricts the effectiveness of the conventional techniques. This paper presents a generic framework, SAMED, to tackle combinatorial optimisation problems. Based on this framework, a new algorithm tailored for Flow Shop Scheduling, SAMED-FSS, has been developed. The performance of the proposed method has been compared with other techniques including a conventional simulated annealing, a standard genetic algorithm, and a hybrid genetic algorithm. The computational results clearly indicate that the proposed algorithm is much more efficient than the conventional heuristics.

Keywords: evolution based diversification; FSS; flow shop scheduling; GAs; genetic algorithms; simulated annealing; tabu search; combinatorial optimisation. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=23545 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:4:y:2009:i:3:p:326-348

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().