Proper Routing of Vehicles Along with Hub Location and Time Window with the Help of Innovative Algorithms (Case Study: Tobacco Company)

Routing is one of the most important issues in designing distribution networks that reduces costs. The purpose of this issue is to meet the demands of customers and minimize costs, including routing, transportation, facilitation and operational costs. Hubs that act as distribution intermediaries are distribution centers and strategic points. In distribution networks with facilities at the origin and destination, they show us according to the problem, the location of the warehouses as a hub is effective in determining the route of the equipment and the related cost, so the production units with location for Distribution warehouses and vehicle routing reduce costs.By looking at the two problems of routing and locating for distribution, it is possible to provide an optimal answer for both problems.The aim of this research is to provide a model for distributing products by simultaneously considering routing and location, in order to reduce costs and reduce environmental damage. Also, customers have a limited time window and the service must be done within the time frame. Exact and meta-heuristic methods, epsilon constraint and multi-objective optimization are used to solve the models. The results show that the proposed method of the study has an acceptable performance and reduces the time to reach the optimum in new routes by a third, the number of centers from 26 to 10, and the number of cars from 59 to 42. Finally, in order to bring the research closer to the real world conditions, the model is implemented on the data of the tobacco company.In the state before the model, the value of the function is equal to 1550222/60, the model presented using the multi-objective particle optimization method, the result is equal to 1331400/15, which shows approximately 218822 units of cost reduction.