“…21 Classical mixed-integer programming has been employed to solve this problem up to optimality. 22,23 However, a large range of metaheuristic techniques have also been employed, including multiobjective evolutionary algorithms, 16,24 gradient search, 17,24 greedy heuristics, 17,24 genetic algorithms, 17,21,[24][25][26] simulated annealing, 17,20,24 particle swarm optimization, 19 and pattern-search algorithms. 17,24 Only a very reduced subset of these works considers nonconventional layouts.…”