A parallel tabu search algorithm for solving the container loading problem

Authors:
A. Bortfeldt;H. Gehring;D. Mack
Affiliations:
FernUniversität, Fachbereich Wirtschaftswissenschaft, Postfach 940, 58084 Hagen, Germany;FernUniversität, Fachbereich Wirtschaftswissenschaft, Postfach 940, 58084 Hagen, Germany;FernUniversität, Fachbereich Wirtschaftswissenschaft, Postfach 940, 58084 Hagen, Germany
Venue:
Parallel Computing - Special issue: Parallel computing in logistics
Year:
2003

Citing 1
Cited 22

Tabu search

Modern heuristic techniques for combinatorial problems

A GRASP Approach to the Container-Loading Problem

IEEE Intelligent Systems
A hybrid approach for multi-objective combinatorial optimisation problems in ship design and shipping

Computers and Operations Research
Translational packing of arbitrary polytopes

Computational Geometry: Theory and Applications
A hybrid simulated annealing algorithm for container loading problem

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Optimizing OSPF routing using accelerated iterative heuristic

AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Parallel tabu search for optimizing the OSPF weight setting problem

WSEAS TRANSACTIONS on COMMUNICATIONS
Neighborhood structures for the container loading problem: a VNS implementation

Journal of Heuristics
A Tree Search Algorithm for Solving the Container Loading Problem

INFORMS Journal on Computing
A caving degree based flake arrangement approach for the container loading problem

Computers and Industrial Engineering
An efficient placement heuristic for three-dimensional rectangular packing

Computers and Operations Research
A hybrid algorithm for vehicle routing problem with time windows

Expert Systems with Applications: An International Journal
A novel hybrid tabu search approach to container loading

Computers and Operations Research
A hybrid 'bee(s) algorithm' for solving container loading problems

Applied Soft Computing
Three-dimensional container loading models with cargo stability and load bearing constraints

Computers and Operations Research
A parallel multi-population biased random-key genetic algorithm for a container loading problem

Computers and Operations Research
A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm

Journal of Global Optimization
A heuristic block-loading algorithm based on multi-layer search for the container loading problem

Computers and Operations Research
Automating the packing heuristic design process with genetic programming

Evolutionary Computation
The six elements to block-building approaches for the single container loading problem

Applied Intelligence
On a Hybrid Genetic Algorithm for Solving the Container Loading Problem with no Orientation Constraints

Journal of Mathematical Modelling and Algorithms
Local search for a multi-drop multi-container loading problem

Journal of Heuristics
A beam search approach to the container loading problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, Universitéde Montréal, 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.