N_a1b1 N_a2b2 or less or less... Or less Nafbf
F=C_q ^ 2=(q) (q - 1)/2
After ordering, goods storage area allocation steps are as follows:
Step1: the smallest category A1B1 N_a1b1 Z1, assigned to the first area for j=1,
Step2: find the next smallest similarity coefficient N_asbs, items and the As and Bs are not assigned to the partition, will the As and Bs assigned to what Zj had in the first j + 1 + 1, j=j + 1,
Step3: when
Step5:
1) if the Bt allocated, At undistributed, make the S_ (j *)=min_ (1 j m S_j or less or less), Sj=?_ (e? "" Z j) N_eat, 1 j m or less, or less each category in the said what Zj had e and category At the sum of similarity coefficient, items will be allocated At j * area,
2) if the item At the Bt all unallocated, makes S_j=?_ (e? "" N_eat Z_j), 1 j m or less, or less S_ (j *)=min_ (1 j m or less or less S_j); T_j=?_ (e? "" N_ebt Z_j), 1 j m or less, or less T_ (j * *)=min (1 j m or less or less Tj)
If Tj or less Sj * * *, item At assigned to j * area, and the sum of the similarity coefficient of j * T_j=?_ (e? "" Update Nebt Z_ (j *)), T_ (j * *)=min_ (1 j m or less or less T_j) Bt assigned to j * * zone,
Items if Sj *> Tj * *, Bt assigned to j * * zone, and the sum of the similarity coefficient of j * * S_j=?_ (e? "" Z_j) update Neat, S_ (j *)=min_ (1 j m S_j) or less or less will be the At assigned to j * area,
Step6: when all items are allocated to each partition, stop, otherwise, continue to Step4
In the process of the above calculation, when there is a same Sj * and Tj * *, the items will be At items and types of Bt priority assigned to less area, when regional category At the same time, the number of phase are allocated arbitrarily choose one area,
Interested in can add my qq: 840198521 WeChat with number,