Routing Cross-Docking Depots, Considering The Time Windows And Pricing Routes (Case Study: Container Transportation Of Chabahar Port)

In this study, we develop a model for routing cross-docking centers considering time windows and pricing routs. In this model picking and delivery in several times is permitted and each knot can be serviced by more than one vehicle. Every truck can transport one or more product, in other words, we consider compatibility between product and vehicle. This model includes two goals: reducing the total cost and reducing the cost of carrying goods (freight fare). The total cost includes the cost required to traverse between the points, the cost of traversing the routes between the central cross-docking center and the first points after moving, and the cost to traverse the routes between the last points in each route and the depots that must be minimized. In general, the purpose of the model is to obtain the number of cross-docking center, the number of vehicles and the best route in the distribution network. We present a nonlinear programming model for this problem. We have solved the proposed model by GAMS. As the dimensions of the problem increase, the implementation time of the program increases progressively. So, in order to solve the model in medium and large scales, we proposed a genetic meta-heuristic algorithm. The results of examining different issues by the meta-heuristic approach show the very high efficiency of the developed algorithms in terms of the solution time and the answer of the problem.