scholarly journals Search efficiency in parallel search is not impacted (or only minimally so) by background complexity.

2021 ◽  
Vol 21 (9) ◽  
pp. 2458
Author(s):  
Yaoyun Cui ◽  
Gavin J.P. Ng ◽  
Alejandro Lleras ◽  
Simona Buetti
2018 ◽  
Vol 18 (10) ◽  
pp. 524
Author(s):  
Gavin Ng ◽  
Simona Buetti ◽  
Alejandro Lleras

2009 ◽  
Author(s):  
Melissa R. Beck ◽  
Maura C. Lohrenz ◽  
J. G. Trafton

2012 ◽  
Vol 178-181 ◽  
pp. 1802-1805
Author(s):  
Chun Yu Ren

The paper is focused on the Multi-cargo Loading Problem (MCLP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.


2007 ◽  
Author(s):  
Elizabeth A. Krupinski ◽  
Hans Roehrig ◽  
Jiahua Fan

2016 ◽  
Vol 65 (3) ◽  
pp. 770-780 ◽  
Author(s):  
Bing-Yang Lin ◽  
Cheng-Wen Wu ◽  
Mincent Lee ◽  
Hung-Chih Lin ◽  
Ching-Nen Peng ◽  
...  

2013 ◽  
Vol 17 (2) ◽  
pp. 551-568 ◽  
Author(s):  
Hassan Barjini ◽  
Mohamed Othman ◽  
Hamidah Ibrahim ◽  
Nur Izura Udzir

Sign in / Sign up

Export Citation Format

Share Document