Optimization in Construction Management Using Adaptive Opposition Slime Mould Algorithm

Table 6

Result Pareto-optimal solutions for case 2.

No.	Pareto-optimal of projects	PCT	PCC	PQI	PSR
Best time
1	[1, 4, 2, 3, 1, 1, 2, 2, 1, 1, 3, 1, 2, 3, 2, 5, 1, 1]	100	143065	75.27	274
	[1, 2, 3, 1, 1, 1, 2, 3, 1, 1, 2, 1, 3, 2, 2, 1, 1, 1]	100	159000	79.48	279
Best cost
2	[4, 5, 3, 3, 4, 3, 3, 2, 1, 1, 3, 4, 3, 2, 2, 5, 3, 2]	141	101865	60.04	221
	[5, 4, 3, 3, 4, 3, 3, 3, 3, 1, 2, 4, 3, 3, 1, 5, 2, 3]	150	101980	60.15	239
Best quality
3	[2, 1, 1, 1, 2, 1, 1, 5, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1]	101	164770	84.46	287
	3, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 3, 1, 1]	111	163850	84.78	283
Best safety
4	[5, 5, 3, 1, 3, 2, 3, 2, 2, 1, 1, 4, 1, 2, 1, 2, 3, 3]	148	137655	68.13	195
	[4, 5, 3, 1, 3, 2, 3, 3, 2, 3, 1, 4, 1, 3, 2, 5, 3, 3]	156	137610	67.19	196