• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Fifth Wuhan International Conference on E-Business: Integration and Innovation through Measurement and Management vol.2 >Two-stage Metaheuristics Algorithm Approach to the Location Routing Problem in Logistic Management
【24h】

Two-stage Metaheuristics Algorithm Approach to the Location Routing Problem in Logistic Management

机译：物流管理中位置路由问题的两阶段元启发式算法

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

摘要

The Location Routing Problem (LRP) is a famous and practical problem in modern Logistic Management. Since the LRP problem includes many candidate facilities and customers with different demands in integrated logistics in studied, it is a combinatorial optimization problem with NP-hard. In original solution of the LRP problem, we usually give fixed assumptions for the modeling; One of the assumptions is there is no traffic jam after we get the optimized routing. However, it is difficult to fulfill this assumption in practice. After being converted to a dynamic optimization problem it becomes a very important problem in real world. In this paper we divide the problem into two sub-problems and then solve them one by one. One sub-problem is deciding which candidate facilities should give service to particular customers on basis of minimum wrap-net method by using heuristic technique. In the second sub-problem, an improved ant algorithm is employed to search for the optimal routes dynamically. The pseudo code is given to the above metaheuristics algorithm as well.
机译：位置路由问题（LRP）是现代物流管理中一个著名且实用的问题。由于LRP问题包括许多候选设施和对集成物流有不同需求的客户，因此这是一个NP-hard的组合优化问题。在LRP问题的原始解决方案中，我们通常会为模型给出固定的假设；假设之一是在获得优化的路由后不会出现流量阻塞。但是，在实践中很难实现这一假设。转换为动态优化问题后，它成为现实世界中非常重要的问题。在本文中，我们将问题分为两个子问题，然后一个一个地解决。一个子问题是使用启发式技术，根据最小包装网方法，确定哪些候选设施应为特定客户提供服务。在第二个子问题中，采用了改进的蚂蚁算法来动态搜索最优路线。伪代码也被赋予上述元启发式算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号