首页> 外文期刊>Expert Systems with Application >Hybrid evolutionary evolutionary algorithm with extreme machine learning fitness function evaluation for two-stage capacitated facility location problems
【24h】

Hybrid evolutionary evolutionary algorithm with extreme machine learning fitness function evaluation for two-stage capacitated facility location problems

机译:求解两阶段受限设施选址问题的具有极限机器学习适应度函数评估的混合进化进化算法

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

摘要

This paper considers the two-stage capacitated facility location problem (TSCFLP) in which products manufactured in plants are delivered to customers via storage depots. Customer demands are satisfied subject to limited plant production and limited depot storage capacity. The objective is to determine the locations of plants and depots in order to minimize the total cost including the fixed cost and transportation cost. However, the problem is known to be NP-hard. A practicable exact algorithm is impossible to be developed. In order to solve large-sized problems encountered in the practical decision process, an efficient alternative approximate method becomes more valuable. This paper aims to propose a hybrid evolutionary algorithm framework with machine learning fitness approximation for delivering better solutions in a reasonable amount of computational time. In our study, genetic operators are adopted to perform the search process and a local search strategy is used to refine the best solution found in the population. To avoid the expensive consumption of computational time during the fitness evaluating process, the framework uses extreme machine learning to approximate the fitness of most individuals. Moreover, two heuristics based on the characteristics of the problem is incorporated to generate a good initial population. Computational experiments are performed on two sets of test instances from the recent literature. The performance of the proposed algorithm is evaluated and analyzed. Compared with other algorithms in the literature, the proposed algorithm can find the optimal or near-optimal solutions in a reasonable amount of computational time. By employing the proposed algorithm, facilities can be positioned more efficiently, which means the fixed cost and the transportation cost can be decreased significantly, and organizations can enhance competitiveness by using the optimized facility location scheme. (C) 2016 Elsevier Ltd. All rights reserved.
机译:本文考虑了两阶段的人员受限设施选址问题(TSCFLP),其中工厂生产的产品通过存储库交付给客户。受限于工厂生产和有限的仓库存储容量,可以满足客户的需求。目的是确定工厂和仓库的位置,以最大程度地减少包括固定成本和运输成本在内的总成本。但是,已知该问题是NP难题。不可能开发出实用的精确算法。为了解决实际决策过程中遇到的大问题,一种有效的替代近似方法变得更有价值。本文旨在提出一种具有机器学习适应度近似的混合进化算法框架,以在合理的计算时间内提供更好的解决方案。在我们的研究中,采用遗传算子来执行搜索过程,并使用局部搜索策略来优化在人口中发现的最佳解决方案。为了避免在适应性评估过程中花费大量的计算时间,该框架使用极限机器学习来近似大多数人的适应性。此外,结合了基于问题特征的两种启发式方法,以生成良好的初始总体。计算实验是根据最近的文献对两组测试实例进行的。对该算法的性能进行了评估和分析。与文献中的其他算法相比,该算法可以在合理的计算时间内找到最优或接近最优的解。通过使用所提出的算法,可以更有效地对设施进行定位,这意味着可以显着降低固定成本和运输成本,并且组织可以通过使用优化的设施选址方案来增强竞争力。 (C)2016 Elsevier Ltd.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号