首页> 外文会议>International Symposium on Experimental Algorithms >A Metaheuristic for a Two Echelon Location-Routing Problem
【24h】

A Metaheuristic for a Two Echelon Location-Routing Problem

机译:两个梯度位置路由问题的成分型

获取原文

摘要

In this paper we consider the design problem of a two-echelon freight distribution system. The aim is to define the structure of a system optimizing the location and the number of two different kinds of facilities, the size of two different vehicle fleets and the related routes on each echelon. The problem has been modeled as a two-echelon location-routing problem (2E-LRP). A tabu-search heuristic efficiently combining the composing subproblems is presented. Results on small, medium and large size instances are reported.
机译:在本文中,我们考虑了双梯级货运分配系统的设计问题。目的是定义系统的结构优化位置和两个不同类型的设施的数量,两个不同的车队的大小以及每个梯度上的相关路线。问题已被建模为双梯级位置路由问题(2E-LRP)。呈现了禁忌搜索启发式组合组合子问题的启发式。报告了小,中等和大尺寸实例的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号