Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem

DOI10.1155/2015/640231zbMath1394.90476WikidataQ59119208 ScholiaQ59119208MaRDI QIDQ1666220

Y. Aharonov

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/640231

Mathematics Subject Classification ID

90C27: Combinatorial optimization