A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Hybrid Metaheuristics

• Publication date

  2014-06-09

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-319-07644-7_7
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Handbook of Metaheuristics

  2019cited by this paper
• Variable Neighborhood Search

  2018cited by this paper
• Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem

  2010cited by this paper
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

  2008cited by this paper
• An improved typology of cutting and packing problems

  2007cited by this paper
• Models and algorithms for three-stage two-dimensional bin packing

  2007cited by this paper
• A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

  2006cited by this paper
• Evolutionary Computation in Combinatorial Optimization

  2006cited by this paper
• The two-dimensional cutting stock problem revisited

  2005cited by this paper
• An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing

  2004cited by this paper
• Solving a Real-World Glass Cutting Problem

  2004cited by this paper
• Models and Bounds for Two-Dimensional Level Packing Problems

  2004cited by this paper
• Parallel Problem Solving from Nature - PPSN VIII

  2004cited by this paper
• Recent advances on two-dimensional bin packing problems

  2002cited by this paper
• Two-dimensional packing problems: A survey

  2002cited by this paper
• A very large scale neighborhood search algorithm for the quadratic assignment problem

  2002cited by this paper
• A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems

  2002cited by this paper
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem

  2001cited by this paper
• Record Breaking Optimization Results Using the Ruin and Recreate Principle

  2000cited by this paper
• Exact Solution of the Two-Dimensional Finite Bon Packing Problem

  1998cited by this paper
• VLSI module placement based on rectangle-packing by the sequence-pair

  1996cited by this paper
• Cutting Stock by Iterated Matching

  1995cited by this paper
• Operations Research Proceedings 1994

  1995cited by this paper
• A faster variant of the Gilmore and Gomory technique for cutting stock problems

  1994cited by this paper
• Two-Dimensional Finite Bin-Packing Algorithms

  1987cited by this paper
• `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

  1978cited by this paper
• An Algorithm for Two-Dimensional Cutting Problems

  1977cited by this paper
• Recursive computational procedure for two-dimensional stock cutting

  1972cited by this paper
• Multistage Cutting Stock Problems of Two and More Dimensions

  1965cited by this paper

• Simplified swarm optimization for cutting optimization problems

  2026cites this paper
• Mathematical models for a cutting problem in the glass manufacturing industry

  2021cites this paper
• Solving a large cutting problem in the glass manufacturing industry

  2020cites this paper
• Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers

  2019cites this paper
• 2D Optimal Cutting Problem

  2018cites this paper
• Subtraction of Two 2D Polygons with Some Matching Vertices

  2018cites this paper
• Heuristic Algorithm for 2D Cutting Stock Problem

  2017cites this paper
• Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

  2017cites this paper
• Analyses and Boolean Operation of 2D Polygons

  2017cites this paper
• El Problema de patrones de corte, clasificación y enfoques/Cutting stock problem, classification and approaches

  2017cites this paper
• Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem

  2016cites this paper
• A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem

  2016influential citation
• Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search

  2015cites this paper