1. Battarra, M., Pessoa, A., Subramanian, A., Uchoa, E.: Exact algorithms for the traveling salesman problem with draft limits. Eur. J. Oper. Res. 235, 115–128 (2014)
2. Davis, L.: Applying adaptive algorithms to epistatic domains. In: Proceedings of the 9th International Joint Conference On Artificial Intelligence - Volume 1, pp. 162–164 (1985)
3. Duarte, B., Oliveira, L., Teixeira, M., Barbosa, M.: Algoritmos meméticos aplicados ao problema do caixeiro viajante com limite de calado. Anais Do LII Simpósio Brasileiro De Pesquisa Operacional (2020)
4. Moscato, P., Norman, M.: A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems. Parallel Comput. Transputer Appl. 1, 177–186 (1992)
5. Glomvik Rakke, J., Christiansen, M., Fagerholt, K., Laporte, G.: The traveling salesman problem with draft limits. Comput. Oper. Res. 39, 2161–2167 (2012)