“…To map k IP cores on n network nodes ( k ≤ n ), the possible core arrangements ( N _ag) on the NoC network is given by: Therefore, it is a combinatorial optimisation problem that requires efficient heuristic algorithms to get solutions. Different heuristic algorithms have been proposed in the literature which try to get the best answer in the limited computing resources, such as BMAP (batch Markovian arrival process), SMAP (smart mobile access point), NMAP (near‐optimal mapping), SA (simulated annealing algorithm), PSO (particle swarm optimisation), GA (genetic algorithm), ACO (ant colony optimisation), GHA (genetic‐based hyper‐heuristic algorithm), [7–15]. GA is a very efficient algorithm which is often used in NoC mapping solutions, [14, 16–18].…”