عنوان مقاله [English]
In this paper a vehicle routing problem with cross docking and split deliveries to customers is considered. The vehicles pick up products from suppliers and then after some consolidation procedures in the cross dock, the same set of vehicles is used to deliver products to customers. The problem mentioned is NP-Hard so exact methods are not a good choice to solve it. A simulated annealing algorithm is proposed and the results for four data sets with 5, 10, 20 and 30 pairs of supplier-customer are compared with a lower bound. The experimental results show the good performance of the proposed simulated annealing algorithm in a reasonable time.