A Tabu Search Algorithm for Vehicle Routing Problem with Simultaneous Deliveries and Pickups
一类集散货物路线问题的禁忌搜索算法设计

The vehicle routing problems with backhauls presume that the delivery and pickup of goods take place at different customer locations.In many practical situations,however,the same customer may require both delivery and pickup of goods simultaneously.According to its features,in this paper,object function is the sum of the fixed and variable expenses consumed by vehicles.Then a SFC-TS Algorithm is proposed: firstly,the initial solution is obtained by means of spacefilling curves in the fractal theory,and then it is impoved by the tabu search algorithm.In the end,computational examples are taken to demonstrate the efficiency of the SFC-TS Algorithm.The results show that the proposed method in the paper can obtain the optimal solutions to the small-sized problems in a much shorter time compared with other algorithms.