...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Optimization in Industrial Engineering >Optimal Localization of Shopping Centers Using Metaheuristic Genetic Algorithm
【24h】

Optimal Localization of Shopping Centers Using Metaheuristic Genetic Algorithm

机译：采用血培育遗传算法的购物中心最佳定位

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Efficiency and effectiveness is of importance for selection and localization. There should be regular methodology for targeting in the market by several methods. There is a necessity to have clear study for selection. In the current research, it has been studied the optimal localization at shopping centers. If there is not accuracy and validity, there will be achieved negative results for these centers such as high costs. Nowadays, these centers have turned into a part of consumer life. Today, they have penetrated consumers behavior and impacted on marketing mix. We can understand the importance of them from real shopping to window -shopping. As a meta-heuristic algorithm that inspired by natural systems, genetic algorithm has been used for problem salving as a mathematic model. The nature of genetic algorithm, which has created a relationship between humanity science and mathematics, is the reason for using it in the research. Given developed indices, Selected Iranian cities were selected for this study. Findings of the research showed that we can achieve accurate results with metaheuristic methods. The research is an applied research in terms of purpose, which is to develop applied knowledge in a certain field.
机译：效率和有效性对于选择和本地化是重要的。通过几种方法将有常规方法来定位在市场上。有必要明确学习选择。在目前的研究中，已经研究了购物中心的最佳本地化。如果没有准确性和有效性，将获得这些中心的负面结果，例如高成本。如今，这些中心已经变成了消费者生活的一部分。今天，他们已经穿透了消费者行为并影响营销组合。我们可以了解他们从真正购物到窗口的重要性 - 商场。作为由天然系统启发的元启发式算法，遗传算法已被用于作为数学模型的问题。遗传算法的性质创造了人类科学与数学关系，是在研究中使用它的原因。鉴于开发的指数，选择了伊朗城市为这项研究。研究结果表明，我们可以通过成胸部方法实现准确的结果。该研究是在目的方面的应用研究，这是在某个领域制定应用知识。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号