%0 Journal Article
%T A Tabu Search Algorithm for Vehicle Routing Problem with Simultaneous Deliveries and Pickups<br>一类集散货物路线问题的禁忌搜索算法设计
%A LI Jian
%A ZHANG Yong
%A <br>李 建
%A 张 永
%J 系统工程理论与实践
%D 2007
%I 
%X 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.
%K vehicle routing problem
%K vehicle routing problem with simultaneous deliveries and pickups
%K spacefilling curves
%K tabu search algorithm<br>车辆路线问题
%K 集散货物路线问题
%K 空间填充曲线法
%K 禁忌搜索法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=446699497718A04D&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=B31275AF3241DB2D&sid=7555FB9CC973F695&eid=AE09EACBCD1B2A13&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=15