%0 Journal Article
%T Self-adaptive Tabu Search for Multiple Demands Vehicle Routing and Scheduling Problems with Time Windows<br>带时间窗的多重运输调度问题的自适应Tabu Search 算法
%A CAI Yan-guang
%A QIAN Ji-xin
%A SUN You-xian
%A <br>蔡延光
%A 钱积新
%A 孙优贤
%J 系统工程理论与实践
%D 2000
%I 
%X Multiple demands vehicle routing problems with time windows(MVRPTW) are proposed by the organization of transportation in industrial production process. In MVRPTW, goods, such as raw and processed materials, are sent to their destinations at the scheduled time. By giving its transformed model, this paper presents a self\|adaptive tabu search for MVRPTW with one vehicle. Our algorithm can memory the search process comprehensively, and applies automatically intensification and diversification in proper time. The algorithm converges rapidly from our computing experiences.
%K vehicle routing
%K tabu search
%K multiple demands vehicle routing
%K multiple demands vehicle routing with time windowx<br>运输调度
%K TabuSearch
%K 多重运输调度
%K 带时间窗的多重运输调度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=1A08D56638D8FF74&yid=9806D0D4EAA9BED3&vid=A04140E723CB732E&iid=59906B3B2830C2C5&sid=ECE8E54D6034F642&eid=771152D1ADC1C0EB&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=15&reference_num=0