1

.
.

. ) (Combinational Optimization
.
) (Discrete Variables
.
) (NP-Hard

-1

. .

.
.

.

.

n x

.

:

:
(
.

( :

.
.

)Minimize or Maximize : F(X

) (1-1
I = 1,2,3,,p

j = 1,2,3,,q

Subject to : g i ( x ) 0
h j ( x) = 0

k = 1,2,3,,n

X kmin < X k < X kmax

} x , x2 , x3 ,..., xn

) (1-1

}=X 1

-1.1

.
1-1
.

) (

1 :1

-1-1-1

 ) (Enumerative Method

. ) (Dynamic Programming
.

) (Based Method Calculus -

-1-1-2

.

.

.


.

 -1-1-3 ) (

) (Heuristic )

.
(Metaheuristic ) (Random Method .
) ( .

.

.

-2 ) (Optimization Problems Combinational

.
) (
.

70
(

. )
.
NP-hard ) (

R,C R

) ( C .

 C .
:
i 0
) = C( i 0 R ) = Min iR C (i

)(2-1
C opt

C opt

i 0 R.

-2-1

.
(TSP
:

N
1
( n 1)

.
2

. 2120

22 5/17 25 6
!
.

.
.

NP-hard

.
.

 ) (

.
.
.

-1

) (Relaxation

LIP) = Linear

Litegar Programming ) ( MIP) = Mixed Integer Programming (

.
.

)
(

(
.

-2

.
. ) (Decomposition

(
)
.

-2-1

) (Iteration .

-2-2 )(Column Generation

)

:
( .
) ( ) (.

-1
-2 ) (.

-3 )(Constructive Search

.
.
.

( .
)

.
.
) (
.
-4 )(Improving Search
.

) (

( .

-4-1 ) (NS= Neighbourhood Search

.
i .

i Ri
)(
.
) (NS
.

.
.

.
.

:
-1
.
-2
.
.

-3

10

 ) (Metaheuristic

- 3

) (NP-Hard .

) (

) (

-1
.
-2

.

.
:

-1
.
-2
.
) (

-3
-4 .
.

.

)(Travelling Salesman Problem = TSP

-3-1

11


) (TSP

.
) n(


. n
.

.
) (Multistart
:

-1

(
-2 )
-3
.
-4 m
-5

-6
-7
.

-8

-3-2
- 1

) (Genetic Algorithm

.

. 1975 ) (Holland 1989 ) (Goldberg

.
.
:

( ) (.
( .

12

( .

( .

.

.

) (
.

.
.

-2
) (Metropolis 1953
) (Vecchi ) (Gelatt ) ( kirkpatrick 1983
. .
) (Simulated Annealing
.
.


.

.

.
.

. .

13


.
.

-1

) (Neural Networks

.

.

1943 ) (Neuron

.




.
.
3-1
Wj

) y i = f (u j

) f (u j

u j = wij xi
i

Wj

Wnj
Xn

14

)
(3-1



U j

Wij
X i
.

) f (u j
wij xi j
= u j j j

i

:
) f (3-2

uj >0

if

uj 0

if

= ) F( u j

uj

) (3-2

.




.

15

 -3
) (Glover 1989
.

) (Tabu Search
.

.
.

.

.

.
.

.

.
.

.

.

.
n
.

16

-4 )(Ant System

 1991 ) (Maniezzo ) (Dorigo ) (Colorni

.

. .

17