现代物流与供应链管理 (16).ppt

上传人:刘静 文档编号:87435318 上传时间:2023-04-16 格式:PPT 页数:11 大小:1.75MB
返回 下载 相关 举报
现代物流与供应链管理 (16).ppt_第1页
第1页 / 共11页
现代物流与供应链管理 (16).ppt_第2页
第2页 / 共11页
点击查看更多>>
资源描述

《现代物流与供应链管理 (16).ppt》由会员分享,可在线阅读,更多相关《现代物流与供应链管理 (16).ppt(11页珍藏版)》请在taowenge.com淘文阁网|工程机械CAD图纸|机械工程制图|CAD装配图下载|SolidWorks_CaTia_CAD_UG_PROE_设计图分享下载上搜索。

1、Modeling of Distribution OptimizationMotivation Problem description Modeling目目录Algorithms Motivation Cost savingEffectiveEnvironmental friendlyDistrbution CenterDemandsDemandsDemandsDemandsDemandsDistrbution CenterProblem description Given a DC,known as“depot-0”,which provides a fleet of identical v

2、ehicle ,each vehicle kK characterized by:its capacity=QkGiven a set of consumers I,each consumer iI characterized by:the amount of demands qiSets¶meter DCProblem description Find the subset of links in A that link the depot and all consumers by tours with lowest travel cost does not exceed the v

3、ehicle capacity QkSolutions of Distribution optimization DCModelingHow to model an optimization problem-choose some decision variables they typically encode the result we are interested in-express the problem constraints in terms of these variables they specify what the solution to the problem are -

4、express the objective function the objective function specifies the quality of each solutionOptimization models ModelingThe result is an optimization model-it is a declarative formulation they specify the“what”,not to“how”-there may be many ways to model an optimization problem Optimization model Mo

5、deling Objective function-Capture the total travel costDistribution optimization model Decision variables -denotes whether link(i,j)A is visited by vehicle k in the solution(i,j)=1 means vehicle visits node j right after visiting node i =0 means link(i,j)A is not visited by vehicle kDCMotivation Add

6、itional considerations:Multiple depots Time windowsHeterogenous fleetsDistribution optimization model Problem constraints-consumers must be visited and can only be visited once-a vehicle enters one node must leave the node-vehicle capacity constraints-subtours elimination constraints DCModeling xij0,1,i,jNuik,ujk0,i,jJ,kKDistribution optimization model minimizeSubject to:Modeling Complexity:Exponential growth Not all of them are feasible-They cannot against the constraints

展开阅读全文
相关资源
相关搜索

当前位置:首页 > 教育专区 > 大学资料

本站为文档C TO C交易模式,本站只提供存储空间、用户上传的文档直接被用户下载,本站只是中间服务平台,本站所有文档下载所得的收益归上传人(含作者)所有。本站仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。若文档所含内容侵犯了您的版权或隐私,请立即通知淘文阁网,我们立即给予删除!客服QQ:136780468 微信:18945177775 电话:18904686070

工信部备案号:黑ICP备15003705号© 2020-2023 www.taowenge.com 淘文阁