Binary Equilibrium Optimization Algorithm for Computing Connected Domination Metric Dimension Problem

Table 2

Results on path graph P_n.

Path graph
N	M		BEOA	BGWO	BPSO	BWO	BSMO	BGO	BAEO	BEHO
4	3	γcr	2	2	2	2	2	2	2	2
		t (sec)	21.1	32.3	29.8	43.2	27.9	58.1	46.3	53.2
		Iteration	1	1	1	2	1	3	2	2
5	4	γcr	3	3	3	3	3	3	3	3
		t (sec)	57.2	65.1	43.9	65.9	33.1	76.8	89.1	81.7
		Iteration	2	6	3	8	2	7	10	8
6	5	γcr	4	4	4	4	4	4	4	4
		t (sec)	94.7	151.8	127.4	189.6	114.9	235.7	218.6	256.1
		Iteration	4	9	24	15	10	39	28	41
7	6	γcr	5	5	5	5	5	5	5	5
		t(sec)	135.9	196.1	211.6	269.4	173.2	291.8	265.1	379.7
		Iteration	9	38	32	18	26	43	29	51
8	7	γcr	6	6	6	6	6	6	6	6
		t (sec)	227.6	212.4	284.2	376.6	218.1	325.7	337.5	412.9
		Iteration	12	15	45	39	18	52	35	49
9	8	γcr	7	7	7	7	7	7	7	7
		t(sec)	159.1	281.2	324.1	428.2	292.1	417.7	421.6	563.2
		Iteration	8	52	23	47	28	63	40	31
10	9	γcr	8	8	8	8	8	8	8	8
		t(sec)	194.6	338.3	369.5	491.7	350.6	501.9	547.4	612.9
		Iteration	23	76	16	59	42	0	29	63
11	10	γcr	9	9	9	9	9	9	9	9
		t(sec)	238.2	391.7	412.1	570.3	211.4	588.1	682.9	659.1
		Iteration	16	31	49	35	56	73	81	24
12	11	γcr	10	10	10	10	10	10	10	10
		t(sec)	304.9	473.7	554.03	635.9	398.5	657.4	739.5	745.8
		Iteration	40	67	72	84	34	62	83	56
13	12	γcr	11	11	11	11	11	11	11	11
		t(sec)	279.5	592.6	386.8	719.1	490.3	745.8	823.6	869.9
		Iteration	24	28	40	92	77	54	69	128
14	13	γcr	12	12	12	12	12	12	12	12
		t(sec)	196.4	689.8	716.5	835.1	583.6	809.4	904.7	972.6
		Iteration	13	39	84	71	55	104	90	62
15	14	γcr	13	13	13	13	13	13	13	13
		t(sec)	232.8	794.4	819.2	903.6	668.19	916.3	1071.5	1057.2
		Iteration	37	56	92	80	48	74	141	97
16	15	γcr	14	14	14	14	14	14	14	14
		t(sec)	327.5	862.07	1045.99	1134.2	805.37	1089.5	1167.2	1196.1
		Iteration	28	75	56	68	39	106	129	83
17	16	γcr	15	15	15	15	15	15	15	15
		t(sec)	253.9	949.2	1112.7	1285.3	928.7	1175.3	1342.6	1308.9
		Iteration	11	63	80	68	39	106	129	83