A parallel multi-population biased random-key genetic algorithm for a container loading problem
type: Item
instance of: scholarly article
title: A parallel multi-population biased random-key genetic algorithm for a container loading problem
zbMATH Open document ID: 1251.90238
author: José Fernando Gonçalves
author: Mauricio G. C. Resende
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107453
zbMATH Keywords: container loading
zbMATH Keywords: 3D packing
zbMATH Keywords: genetic algorithm
zbMATH Keywords: multi-population
zbMATH Keywords: random keys
MaRDI profile type: Publication
full work available at URL: j.cor.2011.03.009
OpenAlex ID: W2015717108
cites work: Loading Multiple Pallets
cites work: Weight distribution considerations in container loading
cites work: An improved typology of cutting and packing problems
cites work: The Three-Dimensional Bin Packing Problem
cites work: A tree search algorithm for solving the container loading problem
cites work: A hybrid genetic algorithm for the container loading problem
cites work: Heuristics for the container loading problem
cites work: A Genetic Algorithm for Solving the Container Loading Problem
cites work: Loading plates with non-identical items
cites work: An efficient approach for the multi-pallet loading problem
cites work: Solving container loading problems by block arrangement
cites work: A parallel hybrid local search algorithm for the container loading problem
cites work: An AND/OR-graph approach to the container loading problem
cites work: A Parallel Genetic Algorithm for Solving the Container Loading Problem
cites work: Three-dimensional packing of items with limited load bearing strength
cites work: A maximal-space algorithm for the container loading problem
cites work: Approximate algorithms for the container loading problem
cites work: Q5473514
cites work: Q4692508
cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization
cites work: A genetic algorithm for the weight setting problem in OSPF routing
cites work: A hybrid genetic algorithm for the job shop scheduling problem
cites work: A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
cites work: Survivable IP network design with OSPF routing
cites work: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
cites work: A genetic algorithm for the resource constrained multi-project scheduling problem
cites work: Neighborhood structures for the container loading problem: a VNS implementation
cites work: Solving the single-container loading problem by a fast heuristic method
DOI: 10.1016/J.COR.2011.03.009
description: scientific article; zbMATH DE number 6107453