首页> 外文期刊>Mathematical Problems in Engineering >An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem
【24h】

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

机译:枢纽定位路径问题的内共生进化算法

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

摘要

We consider a capacitated hub location-routing problem (HLRP) which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitated p-hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA) which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.
机译:我们考虑了一个受限制的枢纽位置路由问题(HLRP),该问题结合了枢纽位置问题和多枢纽车辆路由决策。 HLRP不仅确定容量丰富的p型轮毂在一组潜在轮毂中的位置,而且还处理车辆的路线,以满足客户的需求。该问题被公式化为0-1混合整数规划模型,其目标是最小的总成本包括路由成本,固定集线器成本和固定车辆成本。由于HLRP对大型问题的要求不切实际,因此我们开发了一种基于内共生进化算法(EEA)的解决方法,该方法可以同时解决轮毂位置和车辆路线问题。通过比较研究检查了所提出算法的性能。实验结果表明,提出的EEA可以作为供应链网络规划的可行解决方案。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2015年第12期|525980.1-525980.11|共11页
  • 作者

    Sun Ji Ung;

  • 作者单位

    Hankuk Univ Foreign Studies, Yongin 449791, South Korea;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号