检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海海事大学物流研究中心 [2]湖北经济学院
出 处:《价格理论与实践》2017年第7期157-160,共4页Price:Theory & Practice
基 金:国家自然科学基金资助项目(NO.15BGL084);上海市科委科研计划项目(NO.14DZ2280200)支持
摘 要:目前预定期间和配送期间的成本优化模型,交付成本主要来自于服务车辆的路径成本,这些模型考虑了预订期间的决策,但配送服务期间最后的路径成本却只能近似算出一个比较粗糙的值,难以实现整体成本最小化。对此本文提出了一种新的混合线性整数规划模型,通过ILOG CPLEX得到更好的路径近似成本计算,为优化路径成本提供良好依据。基本思路即生成可能的路径集合,其子集通过集合覆盖方法来选择以获得可行路径,模拟不同需求规模下的时隙配送路径近似成本。计算实验表明,本文提出的优化模型具有良好的计算性能。Currently, the delivery costs vehicles, among the optimization models, mainly come from path selection of delivery which take into account the decisions made during the booking period, but the final path costs during the delivery service can on- ly reach approximate a rough estimate of the value, meaning that it is difficult to achieve the overall cost minimization. In this paper, a new hybrid linear integer pro- gramming model is proposed. ILOG CPLEX can be used to calculate the approximate path cost and provide a good basis for optimizing the path cost. The basic idea is to gener- ate a possible set of paths, whose subsets are selected by the set covering method to obtain feasible paths and simulate the approximate cost of the time-slot delivery paths under different demand scales. Computational experiments show that the proposed opti- mization model has good computational performance.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28