Multi-objective vehicle routing problems with time windows: A vector evaluated artificial bee colony approach

Efraim Oren Nahum, Yuval Hadas, Uriel Spiegel

Research output: Contribution to journalArticlepeer-review

Abstract

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 languageAmerican English
Pages (from-to)41-47
JournalInt. J. Comput. Inf. Technol,
Volume3
Issue number1
StatePublished - 2014

Fingerprint

Dive into the research topics of 'Multi-objective vehicle routing problems with time windows: A vector evaluated artificial bee colony approach'. Together they form a unique fingerprint.

Cite this