Mathematical Problems in Engineering / 2015 / Article / Fig 1

Research Article

Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem

Figure 1

A representation of the two-part chromosome encoding for 15 cities and three salesmen.