mat h ema t ica l o pti m iz at io n me tho ds l oo k po we rl es s. With th e e merg en c e o f a r ti f ic i a l
i n t e l l i g e n c e a n d b i o n i c s , p e o p l e h a v e s i m u l a t e d t h e m f r o m di f f e r e n t p e r s p e c t i v e
based on the characteristics of biological systems and their behavior, designed a series
of strong universal intelligent optimization methods and models. Typical methods are
genetic algorithms, simulated annealing, tabu search, ant colony optimization, particle
s w a r m o p t i m i z a t i o n , a r t i f i c i a l n e u r a l n e t w o r k s , D N A a l g o r i t h m , h a r m o n y s e a r c h
algorithm and so on. In the broad field of science and engineering has demonstrated its
unique capabilities and application results.
This paper introduced the main ideas and implementation process of nested partitions
met hod( NPM) whi ch is a n ew g lo b al o pt imi zat ion algo ri t hm ba sed on w hat Shi and
ólafsson proposed in 1997. It was first proposed in the early 90s of the last century, and
developed slowly. The contents of the thesis include:
1. G e n e r a l l y i n t r o d u c e s c o m p u t a t i o n a l c o m p l e x i t y a n d s u r v e y s
several types of traditional combinatorial optimization problems, some main ideas of
e v o l u t i o n a r y a l g o r i t h m s w h i c h c a n s o l v e N P - h a r d p r o b l e m s a n d t h e i r d e v e l o p m e n t
history.
2. This paper discusses the global convergence of nested partitions method and
optimize efficiency.
3. T h i s p a p e r i n t r o d u c ed t h e t a b u s e a r c h ( T S ) a l g o r i t h m a n d
i n c o r p o r a t ed t h e i d e a s o f T S i n t o t w o o f t h e a r i t h m e t i c o p e r a t o r s o f
N PM t o f o r m t h e c o m b i n e d T S N P a l g o r i t h m t h a t s o l v e d f u n c t i o n o p t i m i z a t i o n . A n d
this algorithm is theoretically feasible and scientific exploration, and the angle from the
experimental verification algorithm.
4. T h i s p a p e r a d o p te d t h e c o n c e p t o f b a c k t r a c k i n g f r o m t h e N e s t e d P a r t i t i o n
m e t h o d ( N PM) a n d a p p l y i t t o t h e A n t C o l o n y O p t i m i z a t i o n ( A C O ) f o r
strengthening the Ant Colony algorithm of local search ability to solve the Knapsack
Problem. Numerical tests on typical instances show the efficiency and advantage of the
algorithm.
The research result of the thesis develops and extends the applications of the Nested
Par t iti ons Alg o rith m an d it s hy bri d a lgor it h m. It n ot o nly pos se s ses goo d t h eo reti cal
significance, but also has great application value. Many tests show that it is a kind of
intelligent algorithm with feasibility and availability, and it provides a new competitive
method for solving complex and hard optimization problems in application.
With the further research, its applied range will be wider.
Ke y w o r d s : N e s t e d P a r t i t i o n s Me t h o d, T a b u S e a r c h , A n t C o l o n y
Algorithm, Function Optimization, knapsack problem