TY - JOUR
T1 - Multi-objective vehicle routing problems with time windows:
T2 - A vector evaluated artificial bee colony approach
AU - Nahum, Efraim Oren
AU - Hadas, Yuval
AU - Spiegel, Uriel
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
UR - http://scholar.google.com/scholar?num=3&hl=en&lr=&q=allintitle%3A%20Multi-objective%20vehicle%20routing%20problems%20with%20time%20windows%3A%20A%20vector%20evaluated%20artificial%20bee%20colony%20approach%2C%20author%3AEfraim%20OR%20author%3AOren%20OR%20author%3ANahum%20OR%20author%3AYuval%20OR%20author%3AHadas%20OR%20author%3AUriel%20OR%20author%3ASpiegel&as_ylo=2014&as_yhi=&btnG=Search&as_vis=0
M3 - Article
VL - 3
SP - 41
EP - 47
JO - Int. J. Comput. Inf. Technol,
JF - Int. J. Comput. Inf. Technol,
IS - 1
ER -