Solving the vehicle routing problem by a hybrid meta-heuristic algorithm
محورهای موضوعی : Mathematical Optimization
Majid Yousefikhoshbakht
1
(Young Researchers Club, Hamedan Branch, Islamic Azad University,
Hamedan, Iran)
Esmaile Khorram
2
(Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Hafez Avenue, Tehran, Iran)
کلید واژه: NP-hard Problems, Vehicle Routing Problem, Ant colony system, Sweep Algorithm,
چکیده مقاله :
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.
