A Heuristic Solution Method to a Stochastic Veicle 一个随机的车辆的启发式求解方法.pptVIP

下载本文档

4
0
约3.42千字
约 22页
2018-06-19 发布于福建
举报
版权申诉

A Heuristic Solution Method to a Stochastic Veicle 一个随机的车辆的启发式求解方法.ppt

1、本文档共22页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

A Heuristic Solution Method to a Stochastic Veicle 一个随机的车辆的启发式求解方法

Bekkjarvik, 04.12.2003 A Heuristic Solution Method for a Stochastic Vehicle Routing Problem Lars Magnus Hvattum Outline of the Presentation The Real-World Problem Vehicle Routing Concepts VRP Dynamic VRP Stochastic VRP Our Problem Solution Approach Behaviour Results Conclusions The Real-World Problem Linjegods A/S, Heimdal Pick-up customers 133 customers per day (on average) About half of the customers are known in advance The rest is revealed during execution Unknown location, demand, time-window Vehicle Routing Concepts (1) The Vehicle Routing Problem (VRP) A set of customers and a central depot A set of vehicles, located at the depot Design minimum cost routes visiting all customers Additional constraints Capacity Time windows Vehicle Routing Concepts (2) Dynamic VRPs A problem is dynamic when inputs to the problem are made known or updated to the decision maker concurrently with the determination of the solution (Psaraftis, 1995) No plan is generated a priori Events are handled as they are revealed over time Need a policy for how the routes should evolve in time as a function of the inputs Vehicle Routing Concepts (3) Stochastic VRPs Some elements of the problem are stochastic Travel times, demands, customers, ... Typically formulated as a two-stage stochastic programming problem The solution is an a priori plan Recourse actions SVRPs are usually static problems! Our Problem A mix of stochastic and dynamic VRPs Divides the time horizon (e.g. 08:00 to 16:00) into m time slots (stages) Make a plan at the beginning of each time slot for how to service the currently known customers May change the plan at the beginning of the next time slot (recourse) Information is received dynamically Modelled as a multi-stage stochastic programming problem with recourse Solution Approach (1) Must create a plan for the rest of the day at the start of each stage (time slot) Attempt 1 (pure dynamic) Ignore stochastic information Solve a static VRP based on the currently known infor