|
An artificial bee colony algorithm for the vehicle routing problem with backhauls and time windows |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Tanawat Worawattawechai 2. Boonyarit Intiyot 3. Chawalit Jeenanunta |
| Title | An artificial bee colony algorithm for the vehicle routing problem with backhauls and time windows |
| Publisher | Research and Development Office, Prince of Songkla University |
| Publication Year | 2562 |
| Journal Title | Songklanakarin Journal of Science and Technology |
| Journal Vol. | 41 |
| Journal No. | 1 |
| Page no. | 151-158 |
| Keyword | meta-heuristic, artificial bee colony, backhaul, time window, vehicle routing problems |
| URL Website | http://rdo.psu.ac.th/sjstweb/index.php |
| ISSN | 0125-3395 |
| Abstract | The vehicle routing problem with backhauls and time windows (VRPBTW) aims to find a feasible vehicle route that minimizes the total traveling distance while imposing capacity, backhaul, and time-window constraints. We present an enhanced artificial bee colony algorithm (EABCA), which is a meta-heuristic, to solve this problem. Three strategies - a forbidden list, the sequential search for onlookers, and the combination of 1-move intra-route exchange and ?-interchange technique - are introduced for EABCA. The proposed method was tested on a set of benchmark instances. The computational results show that the EABCA can produce better solutions than the basic ABCA, and it discovered many new best-known solutions. |
