...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>OPSEARCH >Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search
【24h】

Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search

机译：通过结合禁忌搜索的启发式算法，选择仓库站点以将口粮商店聚集到两个目标

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

摘要

The problem of selecting upto a fixed number of sites, from among a given number of potential warehouse sites for clustering a given number of ration shops in them subject to several constraints with two objectives, is considered. One of the constraints is that each ration shop should be clustered to a unique warehouse site, which is selected for locating a warehouse at it; however there is no restriction on the number of ration shops to be clustered to a selected warehouse site. Another constraint is that the total cost of the warehouses to be set up should not exceed a budgetary amount. The two objectives are to minimize the total cost and duration of meeting requirements of all the ration shops from their assigned warehouses at the selected sites. A heuristic iterative algorithm incorporating tabu search is developed to find the set of efficient solutions of this problem.
机译：考虑了从给定数量的潜在仓库站点中选择最多固定数量的站点以将给定数量的口粮商店聚集在其中的问题，该站点要受到两个目标的几个约束。限制之一是每个口粮店都应聚集到一个唯一的仓库地点，并选择该地点在仓库中定位仓库；但是，对聚集到选定仓库地点的口粮商店的数量没有限制。另一个限制是要建立的仓库的总成本不应超过预算金额。这两个目标是使所有口粮商店在选定地点的指定仓库中满足要求的总成本和持续时间最小化。开发了一种结合禁忌搜索的启发式迭代算法，以找到该问题的有效解决方案集。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号