id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_sgdejolmezfsfeseqbroy6peum	Una Benlic	Memetic search for the quadratic assignment problem	2015	27	.pdf	application/pdf	11704	1290	70	The best version of the memetic algorithm is MRT60 which integrates the modified robust tabu search MRT for offspring improvement. First, the proposed BMA algorithm is based on a new local optimization procedure (i.e., BLS) which adopts an adaptive perturbation mechanism to better memetic approach generates new solutions by applying crossover and/or mutation, followed by a phase of local search to improve each offspring solution. convergence, BMA triggers an adaptive mutation mechanism to the entire population if the best solution found during the search has not been improved during As most local search algorithms for QAP, BLS employs the swap operator Table 2: Comparative results between the proposed memetic algorithm (BMA), BLS (Benlic & Hao, 2013c), and three best performing QAP The performance of a memetic algorithm may be influenced by the characteristics of the search landscape like the average distance between local optima and	./cache/work_sgdejolmezfsfeseqbroy6peum.pdf	./txt/work_sgdejolmezfsfeseqbroy6peum.txt