Trim loss optimization by an improved differential evolution (Q474531): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Summary: The ``trim loss problem'' (TLP) is one of the most challenging problems in context of optimization research. It aims at determining the optimal cutting pattern of a number of items of various lengths from a stock of standard size material to meet the customers' demands that the wastage due to trim loss is minimized. The resulting mathematical model is highly nonconvex in nature accompanied with several constraints with added restrictions of binary variables. This prevents the application of conventional optimization methods. In this paper we use synergetic differential evolution (SDE) for the solution of this type of problems. Four hypothetical but relevant cases of trim loss problem arising in paper industry are taken for the experiment. The experimental results compared with those of the other techniques show the competence of the SDE to solve the problem. | |||
Property / review text: Summary: The ``trim loss problem'' (TLP) is one of the most challenging problems in context of optimization research. It aims at determining the optimal cutting pattern of a number of items of various lengths from a stock of standard size material to meet the customers' demands that the wastage due to trim loss is minimized. The resulting mathematical model is highly nonconvex in nature accompanied with several constraints with added restrictions of binary variables. This prevents the application of conventional optimization methods. In this paper we use synergetic differential evolution (SDE) for the solution of this type of problems. Four hypothetical but relevant cases of trim loss problem arising in paper industry are taken for the experiment. The experimental results compared with those of the other techniques show the competence of the SDE to solve the problem. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C90 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C26 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6372959 / 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/2013/706350 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2083216369 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59028358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A typology of cutting and packing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved typology of cutting and packing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: One-dimensional cutting stock optimization in consecutive time periods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Different transformations for solving non-convex trim-loss problems by MINLP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new model for complete solutions to one-dimensional cutting stock problems. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reel and sheet cutting at a paper mill / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The trim-loss and assortment problems: A survey / 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: A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A population heuristic for constrained two-dimensional non-guillotine cutting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The solution of two-stage guillotine cutting stock problems having extremely varying order demands / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A genetic algorithm solution for one-dimensional bundled stock cutting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Differential Evolution Via Exploiting Opposite Populations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5299234 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient constraint handling method for genetic algorithms / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:54, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Trim loss optimization by an improved differential evolution |
scientific article |
Statements
Trim loss optimization by an improved differential evolution (English)
0 references
24 November 2014
0 references
Summary: The ``trim loss problem'' (TLP) is one of the most challenging problems in context of optimization research. It aims at determining the optimal cutting pattern of a number of items of various lengths from a stock of standard size material to meet the customers' demands that the wastage due to trim loss is minimized. The resulting mathematical model is highly nonconvex in nature accompanied with several constraints with added restrictions of binary variables. This prevents the application of conventional optimization methods. In this paper we use synergetic differential evolution (SDE) for the solution of this type of problems. Four hypothetical but relevant cases of trim loss problem arising in paper industry are taken for the experiment. The experimental results compared with those of the other techniques show the competence of the SDE to solve the problem.
0 references
0 references
0 references
0 references