A hybrid algorithm based on variable neighbourhood for the strip packing problem
type: Item
instance of: scholarly article
title: A hybrid algorithm based on variable neighbourhood for the strip packing problem
zbMATH Open document ID: 1354.90123
author: Defu Zhang
author: Yuxin Che
author: Furong Ye
author: Yain-Whar Si
author: Stephen C. H. Leung
published in: Journal of Combinatorial Optimization
publication date: 2016-08-31T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6620840
zbMATH Keywords: packing problem
zbMATH Keywords: variable neighbourhood search
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: combinatorial optimisation
MaRDI profile type: Publication
full work available at URL: s10878-016-0036-6
OpenAlex ID: W2427605495
Wikidata QID: Q57569978
cites work: Reactive GRASP for the strip-packing problem
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: One-dimensional heuristics adapted for two-dimensional rectangular strip packing
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem
cites work: A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
cites work: Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
cites work: Heuristics for the variable sized bin-packing problem
cites work: Dynamic reduction heuristics for the rectangle packing area minimization problem
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: A new heuristic algorithm for rectangle packing
cites work: Two-dimensional strip packing with unloading constraints
cites work: Two-dimensional packing problems: a survey
cites work: An exact approach to the strip-packing problem
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Exact algorithms for the two-dimensional strip packing problem with and without rotations
cites work: Variable neighborhood search
cites work: An improved typology of cutting and packing problems
cites work: A skyline heuristic for the 2D rectangular packing and strip packing problems
cites work: A block-based layer building approach for the 2D guillotine strip packing problem
cites work: A simple randomized algorithm for two-dimensional strip packing
DOI: 10.1007/S10878-016-0036-6
Recommended article: A hybrid metaheuristic for the two-dimensional strip packing problem
Recommended article: Tabu Search with Consistent Neighbourhood for Strip Packing
Recommended article: A branch and bound algorithm for the strip packing problem
Recommended article: Variable neighbourhood search for the variable sized bin packing problem
Recommended article: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
Recommended article: A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
Recommended article: A variable neighborhood descent approach for the two-dimensional bin packing problem
Recommended article: A hybrid placement strategy for the three-dimensional strip packing problem
description: scientific article; zbMATH DE number 6620840