Exact approaches for the pattern minimization problem

doi:10.1016/j.cie.2026.112012

2026-04-10

Gabriel Gazzinelli Guimaraes

Kelly Cristina Poldi *

DOI：10.1016/j.cie.2026.112012

原文链接

查看原文

摘要

En 中文

• 解决地址模式最小化问题（PMP），扩展约束满足问题（CSP），提出两种新颖方法。• 第一种方法改进了文献中的整数线性规划（ILP），通过更严格的约束和预处理。• 第二种方法：分两阶段——基于三个标准减少模式，并求解新的ILP。• 结果显示在材料使用和设置成本方面优于基准。

Keyword:

Combinatorial optimization

Cutting stock problem

Pattern minimization

Setup minimization

Integer linear programming

Mathematical formulation

AI总结

对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Computers & Industrial Engineering

IF:

6.5

论文数:

562

被引数:

机构

暂无机构信息

引用论文

Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

IF6

2015-06-01

PREAI

Cui, Yaodong; Zhong, Cheng; Yao, Yi

On the cutting stock problem under stochastic demand 随机需求下的削减库存问题

ANNALS OF OPERATIONS RESEARCH

IF4.5

2008-11-05

PREAI

Alem, Douglas Jose, Jr.; Munari, Pedro Augusto, Jr.; Arenales, Marcos Nereu; Valente Ferreira, Paulo Augusto

The integrated lot sizing and cutting stock problem in an automotive spring factory

Applied Mathematical Modelling

IF0

2021-03-01

PREAI

Pedro Rochavetz de Lara Andrade; Silvio Alexandre de Araujo; Adriana Cristina Cherri; Felipe Kesrouani Lemos

Sequential grouping heuristic for the two-dimensional cutting stock problem with pattern reduction

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS

IF10

2013-08-01

PREAI

Cui, Yaodong; Yang, Liu; Zhao, Zhigang; Tang, Tianbing; Yin, Mengxiao

Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems

INFORMS Journal on Computing

IF0

2020-01-01

OAAI

Maxence Delorme; Manuel Iori

CUTGEN1 - A PROBLEM GENERATOR FOR THE STANDARD ONE-DIMENSIONAL CUTTING STOCK PROBLEM

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

IF6

1995-08-01

PREAI

GAU, T; WASCHER, G

Presolving in linear programming 线性规划中的预求解

Mathematical Programming

IF0

1995-12-01

PREAI

Erling D. Andersen; Knud D. Andersen

A hybrid heuristic to reduce the number of different patterns in cutting stock problems 一种混合启发式方法，用于减少切割库存问题中不同模式的数量

COMPUTERS & OPERATIONS RESEARCH

IF4.3

2006-09-01

PREAI

Yanasse, HH; Limeira, MS

A genetic symbiotic algorithm applied to the one-dimensional cutting stock problem

Pesquisa Operacional

IF0

2009-08-01

OAAI

Rodrigo Rabello Golfeto; Antonio Carlos Moretti; Luiz Leduíno de Salles Neto

Cutting stock with no three parts per pattern: Work-in-process and pattern minimization

Discrete Optimization

IF0

2011-05-01

OAAI

Alessandro Aloisio; Claudio Arbib; Fabrizio Marinelli

查看更多内容