Optimizing Of Vehicle Routing Problem Using a New Hybrid Algorithm Based on Ant Colony Optimization and simulated annealing algorithm subject to Precedence Constraints
Optimizing Of Vehicle Routing Problem Using a New Hybrid Algorithm Based on Ant Colony Optimization and simulated annealing algorithm subject to Precedence Constraints
hooman Mazaheripour1 Davoud Sedighizadeh2
1) Department of Industrial Engineering, Saveh Branch, Islamic Azad University(IAU), Saveh, Iran
2) Department of Industrial Engineering, Saveh Branch, Islamic Azad University(IAU), Saveh, Iran
IOI Code
:
XYBD-ZKEGF
Publication :
4th International Conference On Research Science And Technology(4rstconf.com)
Abstract :
Vehicle routing problem is the basic problem of distribution planning which seeks to find the best route with minimum displacement cost considering the number of customers, their constraints, and number and capacity of the available vehicles. In this article, first, the vehicle routing problem are described and, accordingly considering the Precedence constraints among customers. Since such problems are NP-hard problems, the above problem can be solved by different meta-heuristic algorithms; in this article, according to the remarkable results of using hybrid models for different meta-heuristic algorithms, the algorithm proposed for problem solving is a combination of Ant Colony Optimization and simulated annealing algorithm. Finally, by presenting an operational sample, using data of customers in a region, considering different constraints of the problem and its functions, the best vehicle route was obtained and the results of each algorithm together with its hybrid algorithm are demonstrated.
Keywords : vehicle routing problem meta heuristic algorithms ant colony optimization simulated annealing algorithm precedence constraints