A Discrete Harmony Search Algorithm

2010 ◽  
pp. 37-43 ◽  
Author(s):  
Ling Wang ◽  
Yin Xu ◽  
Yunfei Mao ◽  
Minrui Fei
Keyword(s):  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Discrete Harmony Search

The Lot-Streaming Flow Scheduling Shops Based on a Hybrid Discrete Harmony Search Algorithm

2011 ◽  
Vol 204-210 ◽  
pp. 563-568
Author(s):  
Hong Yan Han
Keyword(s):  
Flow Shop ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Flow Shop Scheduling ◽  
Neighborhood Search ◽  
Lot Streaming ◽  
Discrete Harmony Search ◽  
Harmony Memory ◽  
Streaming Flow

To solve the lot-streaming flow shop scheduling problem with the objective to minimize the total weighted earliness and tardiness, a hybrid discrete harmony search (HDHS) algorithm is proposed in this paper. Firstly, an effective harmony memory initialization approach is presented,an initial solution in harmony memory is generated by means of the famous NEH heuristic. Secondly, the HDHS algorithm utilizes an effective improvisation mechanism to generate new harmonies represented by job permutations. Lastly, the insert neighborhood search and swap operator are designed and embedded in the algorithm to enhance the local exploitation.Experimental results demonstrate the effectiveness of the proposed HDHS algorithms.

Sign in / Sign up

Export Citation Format

Share Document