A Kriging surrogate model assisted Tabu search method for electromagnetic inverse problems

2020 ◽  
Vol 64 (1-4) ◽  
pp. 351-358
Author(s):  
Siguang An ◽  
Qiang Deng ◽  
Tianwei Wu ◽  
Shiyou Yang ◽  
Nanying Shentu

To balance the efficiency and accuracy of a global optimization algorithm in solving electromagnetic inverse problems, a Tabu search method assisted by using a Kriging surrogate model is proposed. To reduce the computational time and speed up the algorithm, the Kriging surrogate model is used to predict the objective space. To ensure the accuracy of the final optimal solution, a united trigger is developed to realize dynamically switching between the prediction and the direct objective computation. To utilize the variable space efficiently and provide proper sampling points to update the Kriging surrogate model, an evaluation list is used to evaluate the variable space. A typical mathematical function and electromagnetic inverse problems in low and high frequency are solved to testify the correctness and effectiveness of the proposed method.

2011 ◽  
Vol 47 (5) ◽  
pp. 1234-1237 ◽  
Author(s):  
Siguang An ◽  
Shiyou Yang ◽  
S. L. Ho ◽  
Tao Li ◽  
Weinong Fu

2021 ◽  
Vol 11 (10) ◽  
pp. 4425
Author(s):  
Radosław Idzikowski ◽  
Jarosław Rudy ◽  
Andrzej Gnatowski

In this paper, a non-permutation variant of the Flow Shop Scheduling Problem with Time Couplings and makespan minimization is considered. Time couplings are defined as machine minimum and maximum idle time allowed. The problem is inspired by the concreting process encountered in industry. The mathematical model of the problem and solution graph representation are presented. Several problem properties are formulated, including the time complexity of the goal function computation and block elimination property. Three solving methods, an exact Branch and Bound algorithm, the Tabu Search metaheuristic, and a baseline Genetic Algorithm metaheuristic, are proposed. Experiments using Taillard-based problem instances are performed. Results show that, for the Tabu Search method, the neighborhood based on the proposed block property outperforms other neighborhoods and the Genetic Algorithm under the same time limit. Moreover, the Tabu Search method provided high quality solutions, with the gap to the optimal solution for the smaller instances not exceeding 2.3%.


2006 ◽  
Vol 106 (6) ◽  
pp. 1406-1412 ◽  
Author(s):  
T. Rusu ◽  
V. Bulacovschi

Sign in / Sign up

Export Citation Format

Share Document