应用禁忌搜索算法解决 0-1 背包问题
1 0-1 背包问题
其中 n=20;
a
j
=[92, 4, 43, 83, 84, 68, 92, 82, 6, 44, 32, 18, 56, 83, 25, 96, 70, 48, 14, 58];
c
j
=[44, 46, 90, 72, 91, 40, 75, 35, 8, 54, 78, 40, 77, 15, 61, 17, 75, 29, 75, 63];
b=878。
2 禁忌搜索算法的流程
� � � � � � � � � � � � � � � � � � � � �
� � � � � � � � � � � � � � �
� � � � � � � � �
� � � � � � � � � � � � � � � �
� � � � � � � � � � � � � � � �
� � �
� � � � � � � � � � � � �
� � � � � � � � � � � � � �
� � � � � � � � � � � � �
� � � � � � � � � � �
� � � � � � � � � �
� � � � � � � �
Y
N
Y
N