合肥工业大学学报（自然科学版）
閤肥工業大學學報（自然科學版）
합비공업대학학보（자연과학판）
JOURNAL OF HEFEI UNIVERSITY OF TECHNOLOGY(NATURAL SCIENCE)
2014年
8期
1015-1018,1024
,共5页
汪婷婷%倪郁东%何文玲
汪婷婷%倪鬱東%何文玲
왕정정%예욱동%하문령
车辆路径问题%需求可拆分%数学优化模型%蜂群优化算法
車輛路徑問題%需求可拆分%數學優化模型%蜂群優化算法
차량로경문제%수구가탁분%수학우화모형%봉군우화산법
vehicle routing problem%split delivery%mathematical optimization model%bee colony opti-mization(BCO) algorithm
文章研究了需求可拆分的车辆路径问题，通过解除传统车辆路径问题中每个任务点需求只能由1辆车满足的约束，建立了寻求满足配送要求最短行驶距离的数学优化模型，在改进反应阈值和刺激信号值的基础上提出了一种新型蜂群优化算法。仿真实验结果验证了算法的可行性，并通过与其他典型算法对比凸显了该算法较强的寻优能力。
文章研究瞭需求可拆分的車輛路徑問題，通過解除傳統車輛路徑問題中每箇任務點需求隻能由1輛車滿足的約束，建立瞭尋求滿足配送要求最短行駛距離的數學優化模型，在改進反應閾值和刺激信號值的基礎上提齣瞭一種新型蜂群優化算法。倣真實驗結果驗證瞭算法的可行性，併通過與其他典型算法對比凸顯瞭該算法較彊的尋優能力。
문장연구료수구가탁분적차량로경문제，통과해제전통차량로경문제중매개임무점수구지능유1량차만족적약속，건립료심구만족배송요구최단행사거리적수학우화모형，재개진반응역치화자격신호치적기출상제출료일충신형봉군우화산법。방진실험결과험증료산법적가행성，병통과여기타전형산법대비철현료해산법교강적심우능력。
In this paper ,the split delivery vehicle routing problem is researched and the mathematical optimization model w hich seeks the shortest distance to meet the delivery requirements is constructed . T he model releases the constraint that only one vehicle can be used to meet the delivery requirement for one customer .A new bee colony optimization(BCO) algorithm is proposed based on the improve-ment of the reaction threshold and the value of stimulatory signal .The experimental result proves the feasibility of the algorithm ,and also highlights the strong optimization ability of BCO algorithm by comparison with other typical algorithms .
