The vehicle routing problem with time windows, widely used in practice, is an NPhard problem. The proposed optimization algorithm is based on the artificial bee colony algorithm combined with the vector evaluated technique for solving the problem as a multi-objective problem. Unlike traditional two-steps algorithms, this algorithm provides a simultaneous solution set. The approach was tested on standard Solomon benchmark problems and the result shows that this algorithm was better than or equal to other heuristic algorithms.
|Original language||American English|
|Journal||Int. J. Comput. Inf. Technol,|
|State||Published - 2014|