Heuristic Strategies for a Multi-Allocation Problem in LTL Logistics
Heuristic Strategies for a Multi-Allocation Problem in LTL Logistics
复制标题
零担物流中多分配问题的启发式策略
DOI：
10.1007/978-3-319-00795-3_78
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
J. Fabian
中科院分区：
文献类型：
--
作者：
Clausen;J. Fabian
我们考虑一个多分配问题，其中运输是由完整的（整数值）卡车处理的。它由两部分组成：从一组给定的仓库中选择若干枢纽；然后将给定的运输关系分别分配给两个枢纽、一个枢纽或直接运输。对于路由有四个索引变量，对于卡车有整数变量，这个MIP变得很困难。我们的启发式方法给出了比Cplex实现更好的结果，并且可以用于生成可以再次给出Cplex的受限问题。其思路是：将整个网络看作是将货物发送到选定的仓库的树木的集合，逐步提高总成本，因此我们总是采取最昂贵的运输优势，并尝试为其寻找新的路线。在本文中，我们将解释理论思想，指出不同的可能性，并将它们与计算结果联系起来。
We consider a multi-allocation problem where the transport is handled by complete (integer-valued) trucks. It consists of two parts: A number of hubs are chosen out of a given set of depots; then the given transport relations are individually assigned to two hubs, one hub or direct transport. Having four-index variables for the routing and integer variables for the trucks, this MIP becomes difficult. Our heuristic approach gives much better results than a Cplex implementation and can be used to generate a restricted problem which can again be given to Cplex. The idea is as follows: Considering the whole network as collection ofntrees sending goods to a chosen depot, we improve the total costs step by step: For that we always take the edge with most expensive transport and try to find a new route for it. In our paper we will explain the theoretic ideas, point out different possibilities and connect them to computational results.