• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of computational science >Vehicle routing problem with time windows having stochastic customers demands and stochastic service times: Modelling and solution
【24h】

Vehicle routing problem with time windows having stochastic customers demands and stochastic service times: Modelling and solution

机译：具有随机客户需求和随机服务时间的带有时间窗的车辆路径问题：建模和解决方案

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

On-time and foolproof demand satisfaction has gained attention in today's transportation and logistics industries due to their direct impact on business success. However, the uncertainty in customer's demand, travel times or service times make it difficult to achieve 100% accuracy of these objectives. In the present study, one such issue has been considered as vehicle routing problem with time windows having stochastic demands and stochastic service times. To address this problem, a mathematical model has been developed which tries to maximize customer's satisfaction and at the same time minimize total transportation cost. A modified ant colony system is proposed to solve the developed mathematical model. Numerical results on suitably modified datasets of Solomon benchmarks show that the proposed approach provides low cost solutions while maximizing the number of customers served and minimizing the penalties imposed due to late deliveries with little increase in total travelled distance. Certain penalties formulations provide several managerial insights to decision makers in the transportation industry. (C) 2019 Elsevier B.V. All rights reserved.
机译：由于准时和万无一失的需求满意度直接影响到企业的成功，因此它们已经引起了当今运输和物流行业的关注。但是，由于客户需求，旅行时间或服务时间的不确定性，很难实现这些目标的100％准确性。在本研究中，一个这样的问题被认为是车辆路线问题，其时间窗口具有随机需求和随机服务时间。为了解决这个问题，已经开发了一种数学模型，该模型试图最大化客户的满意度，同时最小化总运输成本。提出了一种改进的蚁群系统来解决开发的数学模型。在对所罗门基准进行适当修改的数据集上的数值结果表明，所提出的方法可提供低成本的解决方案，同时可以最大程度地提高服务的客户数量，并最大程度地减少由于延迟交付而造成的罚款，而总行程距离却很少增加。某些罚则为运输行业的决策者提供了一些管理上的见识。 （C）2019 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号