A parallel tabu search algorithm for solving the container loading problem
A parallel tabu search algorithm for solving the container loading problem
复制标题
DOI：
10.1016/s0167-8191(03)00047-4
复制
发表时间：
2003-05-01
影响因子：
1.4
通讯作者：
Mack, D
中科院分区：
文献类型：
--
作者：
Bortfeldt, A;Gehring, H;Mack, D
针对单箱装箱问题，提出了一种并行禁忌搜索算法。重点是弱非均匀载荷的情况。分布式并行方法基于根据图卢兹等人的多搜索线程的概念[Issues in designing parallel and distributed search algorithms for discrete optimization problems，Publication CRT-96-36，Centre de recherche sur les transmits，Universitede Montreal，Canada，1996]，即，同时研究多个搜索路径。并行搜索由禁忌搜索算法的不同配置的实例进行，其通过在定义的搜索阶段结束时交换（最佳）解决方案来进行合作。并行搜索过程在相应数目的LAN工作站上执行。并行禁忌搜索算法的效率证明了广泛的比较测试，包括著名的参考问题和加载程序从其他作者。(C)2003 Elsevier Science B. V.保留所有权利。
This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Issues in designing parallel and distributed search algorithms for discrete optimization problems, Publication CRT-96-36, Centre de recherche sur les transports, Universitede Montreal, Canada, 1996] i.e., several search paths are investigated concurrently. The parallel searches are carried out by differently configured instances of a tabu search algorithm, which cooperate by the exchange of (best) solutions at the end of defined search phases. The parallel search processes are executed on a corresponding number of LAN workstations. The efficiency of the parallel tabu search algorithm is demonstrated by an extensive comparative test including well-known reference problems and loading procedures from other authors. (C) 2003 Elsevier Science B.V. All rights reserved.