“…Problem-specific heuristics, other heuristics, matheuristics, and multi-search algorithms: Problem-specific heuristics have been parallelized for a variety of optimization problems, including a graph theory problem [Dobrian et al, 2011], TSPs [Ozden et al, 2017, Ismail et al, 2011, a FSSP [Bożejko, 2009], a facility location problem [Lancinskas et al, 2015], a mixed integer linear program [Koc and Mehrotra, 2017], and several other problems [Redondo et al, 2016, Hemmelmayr, 2015, Benedicic et al, 2014, Gomes et al, 2008, Baumelt et al, 2016, Luo et al, 2015. We found four studies which parallelize heuristics that differ from all types described above: an agent-based heuristic [Benedicic et al, 2014], an auction-based heuristic [Sathe et al, 2012], a Monte Carlo simulation inside a heuristic-randomization process [Juan et al, 2013], and a random search algorithm [Sancı and İşler, 2011].…”