A two-objective mathematical model without cutting patterns for one-dimensional assortment problems

DOI10.1016/j.cam.2010.07.019zbMath1430.90380OpenAlexW2044840830MaRDI QIDQ555147

Nergiz Kasimbeyli, Refail Kasimbeyli, Tugba Saraç

Publication date: 22 July 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.07.019

zbMATH Keywords

multi-objective optimizationheuristic algorithmcutting stock problemone-dimensional assortment problemstock size selectiontrim loss minimization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Related Items (4)

A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures ⋮ Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems ⋮ Determining the best shipper sizes for sending products to customers

Cites Work

• A multi-objective programming approach to 1.5-dimensional assortment problem
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• The trim-loss and assortment problems: A survey
• A typology of cutting and packing problems
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• An improved typology of cutting and packing problems
• Cutting optimization with variable-sized stock and inventory status data

This page was built for publication: A two-objective mathematical model without cutting patterns for one-dimensional assortment problems