Journal ArticleDOI
A parallel hybrid local search algorithm for the container loading problem
Reads0
Chats0
TLDR
A simulated annealing method for the CLP is developed, which is then combined with an existing tabu search algorithm to form a hybrid metaheuristic, and parallel versions are introduced for these algorithms.About:
This article is published in International Transactions in Operational Research.The article was published on 2004-09-01. It has received 112 citations till now. The article focuses on the topics: Tabu search & Guided Local Search.read more
Citations
More filters
Journal ArticleDOI
Constraints in container loading – A state-of-the-art review
TL;DR: This work states that container loading problems have been dealt with frequently in the operations research literature and that the proposed approaches are of limited practical value since they do not pay enough attention to constraints encountered in practice.
Journal ArticleDOI
Three-dimensional container loading models with cargo stability and load bearing constraints
TL;DR: These models might be useful to motivate future research exploring other solution approaches to solve this problem, such as decomposition methods, relaxation methods, heuristics, among others.
Journal ArticleDOI
A parallel multi-population biased random-key genetic algorithm for a container loading problem
TL;DR: A multi-population biased random-key genetic algorithm (BRKGA) for the single container loading problem (3D-CLP) where several rectangular boxes of different sizes are loaded into a single rectangular container using a maximal-space representation to manage the free spaces in the container.
Journal ArticleDOI
A Tree Search Algorithm for Solving the Container Loading Problem
Tobias Fanslau,Andreas Bortfeldt +1 more
TL;DR: A tree search algorithm for the three-dimensional container loading problem (3D-CLP), carried out in a special fashion called a partition-controlled tree search, enabling a sufficient search width as well as a suitable degree of foresight.
Journal ArticleDOI
Heuristic approaches for the two- and three-dimensional knapsack packing problem
Jens Egeblad,David Pisinger +1 more
TL;DR: A new iterative heuristic for the two-dimensional knapsack problem based on the sequence pair representation proposed by Murata et al. is presented and able to handle problem instances where rotation is allowed.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Book
Modern heuristic techniques for combinatorial problems
TL;DR: In this paper, the Lagrangian relaxation and dual ascent tree search were used to solve the graph bisection problem and the graph partition problem, and the traveling salesman problem scheduling problems.