Vehicle routing with cross-docking decreasing total cost in the supply chain and storage unrestricted capacity

Cross‐docking is a place which is determined according to routing for discharging goods as well as reloading and also goods can be maintained there for less than 24 hours. This research presents optimal cross‐docking methods and cars routing programme aiming at decreasing transporting cost and determining the number of cars. Here, production capacity is restricted and storage capacity is unrestricted. This model is provided for solving the problem the above goals and the proposed solution can improve the cost of this method and do the work in reasonable time. In the numerical example of the present research study, the number of nodes which must get the service is supposed as 6 and then by investigating the total optimistic, probable and pessimistic costs between each two nodes and by using the presented algorithm PERT, the amount of optimised obtained cost was 14 and the total variance was 3.6667.