id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
iajs-3195	Abass, Iraq T.; Abdulsattar, Rawaa ; Leong WJ 	Solving Quadratic Assignment Problem by Using Meta-heuristic Search Method 	2023	12	.pdf	application/pdf	4552	356	63	The current solution's neighborhood is so confined to solutions that do not belong on the list of violations The extent of the algorithm’s ability to reach the optimal solution, especially in solving Complex Optimization Problems (COP), depends mainly on the algorithm’s ability to diversify the search for the solution, as well as diversify solutions and the speed of reaching the optimal solution depends on the criteria of rejection and acceptance of the new solution because these criteria help determine The search space is in the issue, so whenever this space is reduced, the speed of the algorithm in reaching is faster and also the same higher diversification.	cache/iajs-3195.pdf	txt/iajs-3195.txt