Font Size: a A A

Research On Tabu Search With Its Parallelization

Posted on:2007-06-23Degree:DoctorType:Dissertation
Country:ChinaCandidate:Y HeFull Text:PDF
GTID:1115360185996406Subject:Basic Psychology
Abstract/Summary:PDF Full Text Request
Tabu Search (TS) is a novel intelligence optimization algorithm, which was formally proposed by Prof. Glover in 1986 and it is similar to Evolution Computation (EC), Simulated Annealing (SA), Ant Colony System (ACS), Particle Swarm Optimization (PSO) and Artificial Immune System (AIS), which is belongs to the research domains of Natural Computation (NC) or Computation Intelligence (CI). TS has been being paid more attentions because of its flexible memory structure and corresponding tabu criterion to prohibit from recurrence searching by many scholars and widely applied to combination optimization and function optimization.The dissertation focuses on the applications of TS in Travelling Salesman Problem (TSP), Forward Neural Network and Multidimensional 0-1 Knapsack Problem, and in-deep study on how to improve the performance of basic TS. In addition, three parallel strategies were proposed for how to implement the parallelizing of TS. The main achievements of this dissertation include:(1) An adaptive search strategy was proposed, aiming at the contradiction of...
Keywords/Search Tags:Tabu Search, TSPs, Forward Neural Network, Multidimensional Knapsack Problem, Parallel Computation
PDF Full Text Request
Related items