...
首页> 外文期刊>Computers & Industrial Engineering >Solving a new bi-objective location-routing-inventory problem in a distribution network by meta-heuristics
【24h】

Solving a new bi-objective location-routing-inventory problem in a distribution network by meta-heuristics

机译:用元启发式方法解决配电网中的新的双目标位置路由库存问题

获取原文
获取原文并翻译 | 示例
           

摘要

This paper presents a novel bi-objective location-routing-inventory (LRI) model that considers a multi-period and multi-product system. The model considers the probabilistic travelling time among customers. This model also considers stochastic demands representing the customers' requirement. Location and inventory-routing decisions are made in strategic and tactical levels, respectively. The customers' uncertain demand follows a normal distribution. Each vehicle can carry all kind of products to meet the customer's demand, and each distribution center holds a certain amount of safety stock. In addition, shortage is not allowed. The considered two objectives aim to minimize the total cost and the maximum mean time for delivering commodities to customers. Because of NP-hardness of the given problem, we apply four multi-objective meta-heuristic algorithms, namely multi-objective imperialist competitive algorithm (MOICA), multi-objective parallel simulated annealing (MOPSA), non-dominated sorting genetic algorithm Ⅱ (NSGA-Ⅱ) and Pareto archived evolution strategy (PAES). A comparative study of the forgoing algorithms demonstrates the effectiveness of the proposed MOICA with respect to four existing performance measures for numerous test problems.
机译:本文提出了一种新颖的双目标位置路由清单(LRI)模型,该模型考虑了一个多周期,多产品的系统。该模型考虑了客户之间的概率旅行时间。该模型还考虑了代表客户需求的随机需求。位置和库存路由选择分别在战略和战术级别上做出。客户的不确定需求遵循正态分布。每辆车可以携带各种产品以满足客户的需求,并且每个配送中心都拥有一定数量的安全库存。另外,不允许短缺。所考虑的两个目标旨在最大程度地减少向客户交付商品的总成本和最大平均时间。由于给定问题的NP难点,我们应用了四种多目标元启发式算法,即多目标帝国竞争算法(MOICA),多目标并行模拟退火算法(MOPSA),非支配排序遗传算法Ⅱ( NSGA-Ⅱ)和Pareto存档进化策略(PAES)。对上述算法的比较研究表明,相对于针对多种测试问题的四种现有性能指标,提出的MOICA的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号