首页> 外文期刊>Journal of Cleaner Production >A decomposition approach based on meta-heuristics and exact methods for solving a two-stage stochastic biofuel hub-and-spoke network problem
【24h】

A decomposition approach based on meta-heuristics and exact methods for solving a two-stage stochastic biofuel hub-and-spoke network problem

机译:基于元启发式算法和精确方法的分解方法,用于解决两阶段随机生物燃料枢纽网络问题

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

摘要

An alternative to the production of fossil transportation fuels is the production of biofuels, specifically, bioethanol. One of the main opportunity areas is the reduction in the overall cost of biofuel. An approach to reduce this cost is to design and implement a supply chain (SC) that considers the quality-related properties of the biomass as well as the economies of scale to minimize the logistics and quality-related costs. This problem is formulated as a hub location problem, which has been classified as an NP-hard problem, therefore, meta-heuristics are a suitable approach to solve this problem. We propose a hybrid meta-heuristic solution procedure to solve large-scale instances of a two-stage stochastic biomass-to-biorefinery hub-and-spoke network problem. This solution procedure is proposed to support the large-scale production and distribution of bioethanol by considering the variability in its moisture and ash contents. The hybrid method utilizes a simulated annealing-simplex method to find an initial solution and a tabu search-simplex method to improve the solution. Numerical experimentation was performed on a realistic case study in Texas. The results show that the hybrid procedure outperforms the standard L-shaped (LS) method. The meta-heuristic combining simulated annealing and tabu search with the simplex method (SATS-SM) achieved 2.48% lower costs and required 96.57% less time, on average, when compared to the results from using the LS. (C) 2019 Elsevier Ltd. All rights reserved.
机译:生产化石运输燃料的替代方法是生产生物燃料,特别是生物乙醇。主要的机会领域之一是降低生物燃料的总成本。降低这种成本的一种方法是设计和实施一个供应链(SC),该供应链考虑生物质的质量相关特性以及规模经济,以最大程度地减少与物流和质量相关的成本。该问题被表述为集线器位置问题,该问题已被分类为NP难题,因此,元启发式算法是解决此问题的合适方法。我们提出了一种混合元启发式求解程序,以解决两阶段随机生物质到生物精炼中心辐射网络问题的大规模实例。提出该解决方法是为了通过考虑其水分和灰分含量的变化来支持生物乙醇的大规模生产和分配。混合方法利用模拟退火-简单方法找到初始解,而禁忌搜索-简单方法改进解。在德克萨斯州的一个实际案例研究中进行了数值实验。结果表明,混合程序优于标准的L形(LS)方法。与使用LS的结果相比,将模拟退火和禁忌搜索与单纯形方法(SATS-SM)相结合的元启发式方法平均降低了2.48%的成本,并减少了96.57%的时间。 (C)2019 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号