检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《运筹与管理》2007年第3期12-19,共8页Operations Research and Management Science
基 金:国家自然科学基金资助项目(70371037)
摘 要:本文结合实际情况,对具有时间窗约束的集货送货一体化的车辆路线问题进行了研究,针对该问题的特点,采用修正的多属性标号算法对该问题进行求解,并通过C++编程语言实现了该算法,最后用一个示例表明本文的算法是有效的。In the logistics distribution,the vehicle routes play a key role in influencing the speed,cost and profit of the distribution.For this reason,much of resent research has been placed on the Vehicle Routing Problem(VRP).The present study,based on the Multi-Attribute Label Matching Algorithms,is focused on the Vehicle Routing Problems with Time Windows and Backhauls(VRPTWB).With the improvement on the attribute labels,the algorithms of searching and optimizing the feasible routes have been suggested.A numerical example is tested and the result shows that the algorithm can offer a good solution quickly and is flexible in incorporating real situation.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147