An adaptive penalty based parallel tabu search for constrained covering array generation

2021 ◽  
pp. 106768
Author(s):  
Yan Wang ◽  
Huayao Wu ◽  
Xintao Niu ◽  
Changhai Nie ◽  
Jiaxi Xu
Keyword(s):  
Tabu Search ◽  
Covering Array ◽  
Adaptive Penalty ◽  
Array Generation ◽  
Parallel Tabu Search

AutoCCAG: An Automated Approach to Constrained Covering Array Generation

2021 ◽  
Author(s):  
Chuan Luo ◽  
Jinkun Lin ◽  
Shaowei Cai ◽  
Xin Chen ◽  
Bing He ◽  
...  
Keyword(s):  
Covering Array ◽  
Array Generation

PAPR Reduction Based on Parallel Tabu Search for Tone Reservation in OFDM Systems

2019 ◽  
Vol 8 (2) ◽  
pp. 576-579 ◽  
Author(s):  
Yajun Wang ◽  
Renjie Zhang ◽  
Jun Li ◽  
Feng Shu
Keyword(s):  
Tabu Search ◽  
Papr Reduction ◽  
Ofdm Systems ◽  
Tone Reservation ◽  
Parallel Tabu Search

Multi-objective Parallel Tabu Search

2004 ◽  
pp. 732-741 ◽  
Author(s):  
Daniel Jaeggi ◽  
Chris Asselin-Miller ◽  
Geoff Parks ◽  
Timoleon Kipouros ◽  
Theo Bell ◽  
...  
Keyword(s):  
Tabu Search ◽  
Multi Objective ◽  
Parallel Tabu Search

Parallel Tabu Search for Irregular Cutting

1994 ◽  
pp. 40-42
Author(s):  
J. Błażewicz ◽  
J. Kaczmarek ◽  
R. Walkowiak
Keyword(s):  
Tabu Search ◽  
Parallel Tabu Search

Efficient parallel tabu search for the blocking job shop scheduling problem

2019 ◽  
Vol 23 (24) ◽  
pp. 13283-13295 ◽  
Author(s):  
Adel Dabah ◽  
Ahcene Bendjoudi ◽  
Abdelhakim AitZai ◽  
Nadia Nouali Taboudjemat
Keyword(s):  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Parallel Tabu Search

scholarly journals A Tabu Search-Based Memetic Algorithm for Hardware/Software Partitioning

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Geng Lin ◽  
Wenxing Zhu ◽  
M. Montaz Ali
Keyword(s):  
Tabu Search ◽  
Penalty Function ◽  
Memetic Algorithm ◽  
Feedback Mechanism ◽  
Solution Generation ◽  
Adaptive Penalty ◽  
Adaptive Penalty Function ◽  
Local Search Procedure ◽  
Partitioning Problem ◽  
Unconstrained Problem

Hardware/software (HW/SW) partitioning is to determine which components of a system are implemented on hardware and which ones on software. It is one of the most important steps in the design of embedded systems. The HW/SW partitioning problem is an NP-hard constrained binary optimization problem. In this paper, we propose a tabu search-based memetic algorithm to solve the HW/SW partitioning problem. First, we convert the constrained binary HW/SW problem into an unconstrained binary problem using an adaptive penalty function that has no parameters in it. A memetic algorithm is then suggested for solving this unconstrained problem. The algorithm uses a tabu search as its local search procedure. This tabu search has a special feature with respect to solution generation, and it uses a feedback mechanism for updating the tabu tenure. In addition, the algorithm integrates a path relinking procedure for exploitation of newly found solutions. Computational results are presented using a number of test instances from the literature. The algorithm proves its robustness when its results are compared with those of two other algorithms. The effectiveness of the proposed parameter-free adaptive penalty function is also shown.

Parallel tabu search algorithm for the hybrid flow shop problem

2013 ◽  
Vol 65 (3) ◽  
pp. 466-474 ◽  
Author(s):  
Wojciech Bożejko ◽  
Jarosław Pempera ◽  
Czesław Smutnicki
Keyword(s):  
Tabu Search ◽  
Flow Shop ◽  
Search Algorithm ◽  
Hybrid Flow Shop ◽  
Tabu Search Algorithm ◽  
Flow Shop Problem ◽  
Parallel Tabu Search
Sign in / Sign up

Export Citation Format

Share Document