The objective is to minimize the total travel length under sev-eral constraints:(a)the maximum number of routesconstraintb)travelconstraints,candd)serviceconstraints,(e)thecapacityconstraint,(fthe maximum travel time constraint and (g-i)thetimewindows constraints.For more details see(Tanet al.,2oo1a2001b)
ACO-Tabu·Solutionrepresentation8Fig, 1, A typical vehide routing problem.Fig 2.Sequence code ofthe solution from Fig1
ACO-Tabu • Solution representation