A Divide-and-Conquer Tabu Search Approach for Online Test Paper Generation

2011 ◽  
pp. 717-726 ◽  
Author(s):  
Minh Luan Nguyen ◽  
Siu Cheung Hui ◽  
Alvis C. M. Fong
Keyword(s):  
Tabu Search ◽  
Divide And Conquer ◽  
Test Paper ◽  
Online Test ◽  
Search Approach

Divide-and-conquer memetic algorithm for online multi-objective test paper generation

2012 ◽  
Vol 4 (1) ◽  
pp. 33-47 ◽  
Author(s):  
Minh Luan Nguyen ◽  
Siu Cheung Hui ◽  
Alvis C. M. Fong
Keyword(s):  
Memetic Algorithm ◽  
Divide And Conquer ◽  
Objective Test ◽  
Test Paper ◽  
Multi Objective

Scheduling a flow-line manufacturing cell: a tabu search approach

1993 ◽  
Vol 31 (7) ◽  
pp. 1721-1734 ◽  
Author(s):  
J. SKORIN-KAPOV ◽  
A. J. VAKHARIA
Keyword(s):  
Tabu Search ◽  
Flow Line ◽  
Manufacturing Cell ◽  
Search Approach

A Reinforced Tabu Search Approach for 2D Strip Packing

2012 ◽  
pp. 171-188
Author(s):  
Giglia Gómez-Villouta ◽  
Jean-Philippe Hamiez ◽  
Jin-Kao Hao
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Fitness Function ◽  
Packing Problem ◽  
Two Dimensional ◽  
Strip Packing ◽  
Benchmark Instances ◽  
Finite Set ◽  
Infinite Height ◽  
Search Approach

This paper discusses a particular “packing” problem, namely the two dimensional strip packing problem, where a finite set of objects have to be located in a strip of fixed width and infinite height. The variant studied considers regular items, rectangular to be precise, that must be packed without overlap, not allowing rotations. The objective is to minimize the height of the resulting packing. In this regard, the authors present a local search algorithm based on the well-known tabu search metaheuristic. Two important components of the presented tabu search strategy are reinforced in attempting to include problem knowledge. The fitness function incorporates a measure related to the empty spaces, while the diversification relies on a set of historically “frozen” objects. The resulting reinforced tabu search approach is evaluated on a set of well-known hard benchmark instances and compared with state-of-the-art algorithms.

Sign in / Sign up

Export Citation Format

Share Document