A parallel tabu search algorithm for solving the container loading problem
Parallel Computing - Special issue: Parallel computing in logistics
Modeling transportation problems using concepts of swarm intelligence and soft computing
Modeling transportation problems using concepts of swarm intelligence and soft computing
3-D Container Packing Heuristics
Applied Intelligence
A GRASP Approach to the Container-Loading Problem
IEEE Intelligent Systems
On the performance of artificial bee colony (ABC) algorithm
Applied Soft Computing
Journal of Global Optimization
A new ant colony optimization algorithm for the multidimensional Knapsack problem
Computers and Operations Research
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing
Neighborhood structures for the container loading problem: a VNS implementation
Journal of Heuristics
Solving the single-container loading problem by a fast heuristic method
Optimization Methods & Software - The 22nd European Conference on Operational Research, 8-11 July 2007, Prague, Czech Republic
A HYBRID SIMULATED ANNEALING ALGORITHM FOR SOLVING MULTI-OBJECTIVE CONTAINER-LOADING PROBLEMS
Applied Artificial Intelligence
Using bees to solve a data-mining problem expressed as a max-sat one
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Engineering optimizations via nature-inspired virtual bee algorithms
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Artificial bee colony algorithm: a survey
International Journal of Advanced Intelligence Paradigms
Integrating the artificial bee colony and bees algorithm to face constrained optimization problems
Information Sciences: an International Journal
| Hi-index | 0.00 |
This paper presents a hybrid algorithm to solve container loading problems in which the aim is to load a set of rectangular items (boxes) into a single rectangular large object (container) in order to maximize the total volume of packed boxes. The algorithm is obtained by hybridizing a heuristic filling procedure with a new population based optimization algorithm, namely; 'bee(s) algorithm' (BA). Inspired from the algorithm introduced by [40], the proposed BA algorithm is designed to work with discrete variables. For this purpose, different operators (to reach neighborhood solutions) are used. The proposed hybrid BA algorithm is tested in the context of two well-known sets of test problems available in the literature. Implications of the results are also discussed.