TaBoo SeArch Algorithm with a Modified Inverse Histogram for Reproducing Biologically Relevant Rare Events of Proteins

2016 ◽  
Vol 12 (5) ◽  
pp. 2436-2445 ◽  
Author(s):  
Ryuhei Harada ◽  
Yu Takano ◽  
Yasuteru Shigeta
Keyword(s):  
Rare Events ◽  
Search Algorithm ◽  
Biologically Relevant ◽  
Taboo Search ◽  
Taboo Search Algorithm

scholarly journals Research on Cooperative Scheduling of Automated Quayside Cranes and Automatic Guided Vehicles in Automated Container Terminal

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Qianru Zhao ◽  
Shouwen Ji ◽  
Dong Guo ◽  
Xuemin Du ◽  
Hongxuan Wang
Keyword(s):  
Search Algorithm ◽  
Container Terminal ◽  
Container Terminals ◽  
Automated Guided Vehicles ◽  
Total Energy Consumption ◽  
Two Stage ◽  
Taboo Search ◽  
Automatic Guided Vehicles ◽  
Collaborative Scheduling ◽  
Taboo Search Algorithm

According to previous research studies, automated quayside cranes (AQCs) and automated guided vehicles (AGVs) in automated container terminals have a high potential synergy. In this paper, a collaborative scheduling model for AQCs and AGVs is established and the capacity limitation of the transfer platform on AQCs is considered in the model. The minimum total energy consumption of automated quayside cranes (AQCs) and Automatic Guided Vehicles (AGVs) is taken as the objective function. A two-stage taboo search algorithm is adopted to solve the problem of collaborative scheduling optimization. This algorithm integrates AQC scheduling and AGV scheduling. The optimal solution to the model is obtained by feedback from the two-stage taboo search process. Finally, the Qingdao Port is taken as an example of a data experiment. Ten small size test cases are solved to evaluate the performance of the proposed optimization methods. The results show the applicability of the two-stage taboo search algorithm since it can find near-optimal solutions, precisely and accurately.

Fast Tabu Search Algorithm for Solving Multi-Vehicle and Multi-Cargo Loading Problem

2013 ◽  
Vol 655-657 ◽  
pp. 2397-2400
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Loading Capacity ◽  
Tabu Search Algorithm ◽  
Speed Of Convergence ◽  
Taboo Search ◽  
Insertion Method ◽  
Loading Problem ◽  
Taboo Search Algorithm

This paper studies multi-vehicle and multi-cargo loading problem under the limited loading capacity. According to the characteristics of model and problem, fast taboo search algorithm is used to get the optimization solution from the overall situation. Firstly, it applies newly improved insertion method to construct initial solution in order to improve the feasibility of the solution. Secondly, it centers cubage-weight balance to design three operations for fastening the speed of convergence, stock elite to improve the searching efficiency of algorithm. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples for solving practical problems.

Taboo Search Algorithm for Optimizing Shunting Scheme of Through Wagon Flow Delivering and Fetching Operation

2012 ◽  
Vol 178-181 ◽  
pp. 1908-1914
Author(s):  
Jin Bao Xie ◽  
Ying Han ◽  
Long Han ◽  
Rui Na Yang
Keyword(s):  
Processing Time ◽  
Search Algorithm ◽  
Fitness Function ◽  
Optimal Solution ◽  
Two Dimensional ◽  
Taboo Search ◽  
Taboo Search Algorithm ◽  
Iteration Number ◽  
Simulation Results ◽  
Predetermined Number

In order to improve the efficiency of selecting the optimal scheme from the delivering and fetching shunting schemes of through wagon flow to and from the enterprise dedicated lines which are located in radial shape, the taboo search algorithm is applied in the process finding the optimal solution. The objective function is directly used as the fitness function, and the solution generated by exchanging the wagon group delivering order of one dedicated line with another is taken as the new solution; the taboo list is two-dimensional array, and a fixed value is given as the taboo length; if the evaluation value of the current optimal solution is superior to the historical one, the taboo rules will be defied and the current optimal solution be directly accepted; once the iteration number reaches the predetermined number, the calculating process will be terminated. The simulation results verify the effectiveness of the Taboo search algorithm to the problem, and show that the bigger the number of the dedicated lines, the more the number of equivalent schemes and the higher the searching efficiency is. And the smaller the number of the equivalent schemes, the bigger the search scope is. If the number of the dedicated lines is not more than 8, the processing time by computer is not longer than 15 milliseconds.

Sign in / Sign up

Export Citation Format

Share Document