Solving of vehicle routing problem with cross docking by scatter search algorithm

One of methods of improvement of the material flow is cross docking that In is considered as a good method to reduce inventory and improve customer satisfaction. Too, the vehicle routing problem is one of the important problems in distribution management and its goal is to find paths for delivering various cargos. Therefore, this study was conducted in order to vehicle routing problem with Cross-docking in MEHRIZ SHADI MEHREGAN Biscuit and the problem was solved with a scatter search Algorithm. The findings concluded that the optimal distance by scatter search Algorithm was equal to 11,438 km that Compared with the current status that improved respectively of 30.54%. The optimal cost by scatter search algorithm was equal to 10186655 that Compared with the current status and improved 6.7%. Therefore, can be concluded that the scatter search Algorithm is a good solution to this problem.