检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵玉荣[1]
机构地区:[1]安徽理工大学电气与信息工程学院,安徽淮南232001
出 处:《中国科技信息》2012年第6期105-106,共2页China Science and Technology Information
摘 要:针对多配送中心煤炭车辆调度问题的复杂性,建立该问题的数学模型并提出合理假设和约束条件,以缩短配送路径降低配送成本为目标构造该问题的目标函数。文章结合实例应用蚁群算法对煤炭配送路径进行优化降低运输成本,通过实验验证了蚁群算法在煤炭配送路径优化问题的有效性。In connection with the complexity of multi-depot coal vehicle scheduling problem, the math model of the problem was built, the reasonable hypothesis and constraint conditions were also proposed in this paper, and construct the objective function of this problem in order to shorten distribution Path and reduce distribution costs. The paper combined with an example to optimize the coal distribution path and reduce transportation costs based on the application of ant colony algorithm, the test proved the effectiveness of the ant colony algorithm in coal distribution path.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249