期刊名称：International Journal of Computer and Information Technology
印刷版ISSN：2279-0764
出版年度：2014
卷号：3
期号：1
页码：41
出版社：International Journal of Computer and Information Technology
摘要：The vehicle routing problem with time windows, widely used in practice, is an NP-hard problem. This paper presents a new meta-heuristic algorithm for solving the problem. Unlike traditional two-steps algorithms, the proposed optimization algorithm, based on the artificial bee colony algorithm combined with the vector evaluated technique, solves the problem as a multi-objective problem. As a result, the algorithm provides a simultaneous solution set. The approach was tested on standard Solomon's benchmark problems. The result shows that this algorithm was better than (in terms of number of vehicles) or equal to other existing heuristic algorithms
