Skip to main content
Kent Academic Repository

Hybrid Simulated Annealing With Memory: An Evolution-based Diversification Approach

Azizi, Nader, Zolfaghari, Saeed, Liang, Ming (2010) Hybrid Simulated Annealing With Memory: An Evolution-based Diversification Approach. International Journal of Production Research, 48 (18). pp. 5455-5480. ISSN 0020-7543. (doi:10.1080/00207540903055685) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:29947)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL:
http://dx.doi.org/10.1080/00207540903055685

Abstract

This study presents an efficient metaheuristic approach for combinatorial optimisation and scheduling problems. The hybrid algorithm proposed in this paper integrates different features of several well-known heuristics. The core component of the proposed algorithm is a simulated annealing module. This component utilises three types of memories, one long-term memory and two short-term memories. The main characteristics of the proposed metaheuristic are the use of positive (reinforcement) and negative (inhibitory) memories as well as an evolution-based diversification approach. Job shop scheduling is selected to evaluate the performance of the proposed method. Given the benchmark problem, an extended version of the proposed method is also developed and presented. The extended version has two distinct features, specifically designed for the job shop scheduling problem, that enhance the performance of the search. The first feature is a local search that partially explores alternative solutions on a critical path of any current solution. The second feature is a mechanism to resolve possible deadlocks that may occur during the search as a result of shortage in acceptable solutions. For the case of job shop scheduling, the computational results and comparison with other techniques demonstrate the superior performance of the proposed methods in the majority of cases.

Item Type: Article
DOI/Identification number: 10.1080/00207540903055685
Uncontrolled keywords: simulated annealing, tabu search, evolution-based diversification, genetic algorithm, job shop scheduling
Subjects: H Social Sciences
H Social Sciences > H Social Sciences (General)
Divisions: Divisions > Kent Business School - Division > Kent Business School (do not use)
Depositing User: Catherine Norman
Date Deposited: 27 Jul 2012 10:08 UTC
Last Modified: 16 Nov 2021 10:07 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/29947 (The current URI for this page, for reference purposes)

University of Kent Author Information

Azizi, Nader.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.