Trim loss optimization by an improved differential evolution
From MaRDI portal
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
- scientific article; zbMATH DE number 6180936 (Why is no real title available?)
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A genetic algorithm solution for one-dimensional bundled stock cutting
- 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 Via Exploiting Opposite Populations
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- 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
(1)
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)
