Trim loss optimization by an improved differential evolution

DOI10.1155/2013/706350MaRDI QIDQ474531zbMATH OpenOpenAlexWikidataFDO

Authors Musrrat Ali, Chang Wook Ahn, Millie Pant

Publication date 24 November 2014

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/706350

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90)

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.

Recommendations

• Solving a two-dimensional trim-loss with MILP
• Different transformations for solving non-convex trim-loss problems by MINLP
• Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
• Selection and Design of Heuristic Procedures for Solving Roll Trim Problems
• Setup minimising conditions in the trim loss problem

Cites work

• A genetic algorithm solution for one-dimensional bundled stock cutting
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• A new model for complete solutions to one-dimensional cutting stock problems.
• A population heuristic for constrained two-dimensional non-guillotine cutting
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• A typology of cutting and packing problems
• An efficient constraint handling method for genetic algorithms
• An improved typology of cutting and packing problems
• Different transformations for solving non-convex trim-loss problems by MINLP
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Differential Evolution Via Exploiting Opposite Populations
• scientific article; zbMATH DE number 6180936 (Why is no real title available?)
• One-dimensional cutting stock optimization in consecutive time periods
• Reel and sheet cutting at a paper mill
• Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
• The solution of two-stage guillotine cutting stock problems having extremely varying order demands
• The trim-loss and assortment problems: A survey

Cited in

(4)

• Solving a two-dimensional trim-loss with MILP
• Different transformations for solving non-convex trim-loss problems by MINLP
• Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
• A description of supply chain planning problems in the paper industry with literature review

This page was built for publication: Trim loss optimization by an improved differential evolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474531)