首页> 外文OA文献 >A Multi-objective Intelligent Water Drop Algorithm to Minimise Cost Of Goods Sold and Time to Market in Logistics Networks
【2h】

A Multi-objective Intelligent Water Drop Algorithm to Minimise Cost Of Goods Sold and Time to Market in Logistics Networks

机译:多目标智能水滴算法可最大程度减少物流网络中的销售成本和上市时间

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。
获取外文期刊封面目录资料

摘要

The Intelligent Water Drop (IWD) algorithm is inspired by the movement of natural water drops (WD) in a river. A stream can find an optimum path considering the conditions of its surroundings to reach its ultimate goal, which is often a sea. In the process of reaching such destination, the WD and the environment interact with each other as the WD moves through the river bed. Similarly, the supply chain problem can be modelled as a flow of stages that must be completed and optimised to obtain a finished product that is delivered to the end user. Every stage may have one or more options to be satisfied such as suppliers, manufacturing or delivery options. Each option is characterised by its time and cost. Within this context, multi–objective optimisation approaches are particularly well suited to provide optimal solutions. This problem has been classified as NP hard; thus, this paper proposes an approach aiming to solve the logistics network problem using a modified multi–objective extension of the IWD which returns a pareto set. Artificial WD, flowing through the supply chain, will simultaneously minimise the cost of goods sold and the lead time of every product involved by using the concept of Pareto optimality. The proposed approach has been tested over instances widely used in literature yielding promising results which are supported by the performance measurements taken by comparison to the Ant Colony Meta-heuristic as well as the true fronts obtained by exhaustive enumeration. The pareto set returned by IWD is computed in 4 seconds and the Generational Distance, Spacing, and Hyper–area metrics are very close to those computed by exhaustive enumeration. Therefore, our main contribution is the design of a new algorithm that overcome the algorithm proposed by Moncayo-Martínez and Zhang (2011). This paper contributes to enhance the current body of knowledge of expert and intelligent systems by providing a new, effective and efficient IWD-based optimisation method for the design and configuration of supply chain and logistics networks taking into account multiple objectives simultaneously.
机译:智能水滴(IWD)算法的灵感来自河流中自然水滴(WD)的运动。考虑到周围环境的条件,溪流可以找到一条最佳路径,以达到其最终目标(通常是大海)。在到达目的地的过程中,当WD在河床中移动时,WD和环境会相互影响。类似地,供应链问题可以建模为必须完成和优化以获得交付给最终用户的最终产品的阶段流程。每个阶段可能都有一个或多个要满足的选项,例如供应商,制造或交付选项。每个选项都以其时间和成本为特征。在这种情况下,多目标优化方法特别适合提供最佳解决方案。这个问题被列为NP难;因此,本文提出了一种方法,该方法旨在使用IWD的修改后的多目标扩展(返回pareto集)来解决物流网络问题。通过使用帕累托最优概念,流经供应链的人工WD将同时最小化所售商品的成本和所涉及的每种产品的交货时间。所提出的方法已经在广泛用于文献的实例上进行了测试,并产生了可喜的结果,通过与蚂蚁殖民地元启发式算法以及穷举枚举获得的真实前沿进行比较,所获得的性能测量结果为该方法提供了支持。 IWD返回的pareto集合在4秒钟内计算出来,世代距离,间距和超区域度量非常接近穷举枚举所计算的那些。因此,我们的主要贡献是克服了Moncayo-Martínez和Zhang(2011)提出的新算法的设计。本文通过为供应链和物流网络的设计和配置同时提供多个目标,提供了一种新的,有效的,高效的,基于IWD的优化方法,有助于增强专家和智能系统的现有知识。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号