By Topic

A New Meta-heuristic Approach for Combinatorial Optimization and Scheduling Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Azizi, N. ; Dept. of Mech. Eng., Ottawa Univ., Ont. ; Zolfaghari, S. ; Ming Liang

This study presents a new metaheuristic approach that reasonably combines different features of several well-know heuristics. The core component of the proposed algorithm is a simulated annealing that utilizes three types of memories, two short-term memories and one long-term memory. The purpose of the two short-term memories is to guide the search toward good solutions. While the aim of the long term memory is to provide means for the search to escape local optima through increasing the diversification phase in a logical manner. The long-term memory is considered as a population list. In specific circumstances, members of the population might be employed to generate a new population from which a new initial solution for the simulated annealing component is generated. Job shop scheduling problem has been used to test the performance of the proposed method

Published in:

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Date of Conference:

1-5 April 2007