首页> 外文会议>International Conference on Civil Engineering, Architecture and Building Materials >A Two-phase Meta Heuristic Approach to the Location-Routing Problem for Transportation Network Planning
【24h】

A Two-phase Meta Heuristic Approach to the Location-Routing Problem for Transportation Network Planning

机译:运输网络规划地点路由问题的两相荟萃启发式方法

获取原文

摘要

In this paper we consider the location-routing problem which combines the facility location and the vehicle routing decisions. In this type of problem, we have to determine the location of facilities within a set of possible locations and routes of the vehicles to meet the demands of number of customers. Since the location-routing problem is NP-hard, it is difficult to obtain optimal solution within a reasonable computational time. Therefore, a two-phase ant colony optimization algorithm is developed which solves facility location problem and vehicle routing problem hierarchically. Its performance is examined through a comparative study. The experimental results show that the proposed ant colony optimization algorithm can be a viable solution method for the general transportation network planning.
机译:在本文中,我们考虑将设施位置和车辆路由决策结合的位置路由问题。在这种类型的问题中,我们必须在车辆的一系列可能位置和路线中确定设施的位置,以满足客户数量的需求。由于位置路由问题是NP - 硬,因此难以在合理的计算时间内获得最佳解决方案。因此,开发了一种两相蚁群优化算法,其在层次的方式解决设施位置问题和车辆路由问题。通过比较研究检查其性能。实验结果表明,建议的蚁群优化算法可以是一般运输网络规划的可行解决方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号