TY - JOUR
ID - 676436
TI - Solving the vehicle routing problem by a hybrid meta-heuristic algorithm
JO - Journal of Industrial Engineering, International
JA - JIEI
LA - en
SN - 1735-5702
AU - Yousefikhoshbakht, Majid
AU - Khorram, Esmaile
AD - Young Researchers Club, Hamedan Branch, Islamic Azad University,
Hamedan, Iran
AD - Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Hafez Avenue, Tehran, Iran
Y1 - 2012
PY - 2012
VL - 8
IS - 1
SP -
EP -
KW - Ant colony system
KW - NP-hard Problems
KW - Sweep Algorithm
KW - Vehicle Routing Problem
DO -
N2 - The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm called sweep algorithm (SW) + ant colony system (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW, and at the second stage, the ACS and 3-opt local search are used for improving the solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach.
UR - http://jiei.azad.ac.ir/article_676436.html
L1 - http://jiei.azad.ac.ir/article_676436_a69cdc8e0fc7b15486ab43a3daed914f.pdf
ER -