Table 18 Routing of vehicles and distance obtained by nSCA on 16-customer problem.

From: Enhancing engineering optimization using hybrid sine cosine algorithm with Roulette wheel selection and opposition-based learning

Routes of the vehicles on 16-customer problem

Distance

Route 1

0 → Customer 4 → Customer 8 → Customer 1 → Customer 14 → Customer 3 → Customer 9 → 0

168

Route 2

0 → Customer 6 → Customer 11 → Customer 7 → Customer 13 → Customer 16 → Customer 10 → 0

171

Route 3

0 → Customer 12 → Customer 5 → Customer 2 → Customer 15 → 0

124

Total distance: 463