首页> 外文会议>Knowledge-Based Intelligent Information and Engineering Systems pt.1; Lecture Notes in Artificial Intelligence; 4251 >A Combination of Simulated Annealing and Ant Colony System for the Capacitated Location-Routing Problem
【24h】

A Combination of Simulated Annealing and Ant Colony System for the Capacitated Location-Routing Problem

机译:模拟退火和蚁群系统相结合的能力定位路径问题

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

摘要

Location-Routing Problem (LRP) can model several life situations. In this paper we study The Capacitated Location Routing Problem (CLRP) which is defined as a combination of two problems: the Facility Location Problem (FLP) and the Vehicle Routing problem (VRP). We propose a two-phase approach to solve the CLRP. The approach is based on Simulated Annealing algorithm (SA) and Ant Colony System (ACS). The experimental results show the efficiency of our approach.
机译:位置路由问题(LRP)可以对几种生活状况进行建模。在本文中,我们研究了容量定位路由问题(CLRP),它被定义为两个问题的组合:设施定位问题(FLP)和车辆路由问题(VRP)。我们提出了两阶段方法来解决CLRP。该方法基于模拟退火算法(SA)和蚁群系统(ACS)。实验结果表明了我们方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号