Mathematical modeling and optimal blank generation in glass manufacturing (Q2336874): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q283952
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: M. Montaz Ali / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NOMAD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OrthoMADS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/959453 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065677521 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57931916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods for thep-median problem: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 909 / rank
 
Normal rank

Latest revision as of 00:45, 21 July 2024

scientific article
Language Label Description Also known as
English
Mathematical modeling and optimal blank generation in glass manufacturing
scientific article

    Statements

    Mathematical modeling and optimal blank generation in glass manufacturing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2019
    0 references
    Summary: This paper discusses the stock size selection problem [\textit{M. L. Chambers} and \textit{R. G. Dyson}, ``The cutting stock problem in the flat glass industry-selection of stock sizes'', Oper. Res. Quart. 27, No. 4, 949--957 (1976; \url{doi:10.1057/jors.1976.187})], which is of relevance in the float glass industry. Given a fixed integer \(N\), generally between 2 and 6 (but potentially larger), we find the \(N\) best sizes for intermediate stock from which to cut a roster of orders. An objective function is formulated with the purpose of minimizing wastage, and the problem is phrased as a combinatorial optimization problem involving the selection of columns of a cost matrix. Some bounds and heuristics are developed, and two exact algorithms (depth-first search and branch-and-bound) are applied to the problem, as well as one approximate algorithm (NOMAD). It is found that wastage reduces dramatically as \(N\) increases, but this trend becomes less pronounced for larger values of \(N\) (beyond 6 or 7). For typical values of \(N\), branch-and-bound is able to find the exact solution within a reasonable amount of time.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references