VCS: A new heuristic function for selecting boxes in the single container loading problem
type: Item
instance of: scholarly article
title: VCS: A new heuristic function for selecting boxes in the single container loading problem
zbMATH Open document ID: 1391.90040
author: Keitel Guerrero
author: Eduardo Nuñez
author: I. Araya
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6901396
zbMATH Keywords: container loading problem
zbMATH Keywords: load planing
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: constructive algorithms
zbMATH Keywords: evaluation function
Wikidata QID: Q56476020
MaRDI profile type: Publication
full work available at URL: j.cor.2017.01.002
OpenAlex ID: W2569397598
cites work: A beam search approach to the container loading problem
cites work: Multidimensional binary search trees used for associative searching
cites work: Loading plates with non-identical items
cites work: A hybrid genetic algorithm for the container loading problem
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
cites work: Weight distribution considerations in container loading
cites work: A tree search algorithm for solving the container loading problem
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: A parallel multi-population biased random-key genetic algorithm for a container loading problem
cites work: An efficient placement heuristic for three-dimensional rectangular packing
cites work: An efficient deterministic heuristic for two-dimensional rectangular packing
cites work: A caving degree approach for the single container loading problem
cites work: A new heuristic algorithm for cuboids packing with no orientation constraints
cites work: MIP-based approaches for the container loading problem with multi-drop constraints
cites work: Three-dimensional container loading models with cargo stability and load bearing constraints
cites work: A novel hybrid tabu search approach to container loading
cites work: Q3993418
cites work: Packing small boxes into a big box.
cites work: Neighborhood structures for the container loading problem: a VNS implementation
cites work: A maximal-space algorithm for the container loading problem
cites work: An improved typology of cutting and packing problems
cites work: An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
cites work: A simple randomized algorithm for two-dimensional strip packing
cites work: A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
DBLP publication ID: journals/cor/ArayaGN17
DOI: 10.1016/J.COR.2017.01.002
description: scientific article; zbMATH DE number 6901396