getCITED   
  Home     Search     Add Content     Reports     Help  
Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations
Add to Bookstack | Show Bookstack | Change Bookstack

A GENETIC ALGORITHM APPROACH FOR SOLVING THE TRIM LOSS OPTIMIZATION PROBLEM IN PAPER MANUFACTURING INDUSTRIES

Post a Comment
CONTRIBUTORS:
  Author BINITHA S
  Author Dr. S.SIVA SATHYA
JOURNAL:
  International Journal of Engineering Science and Technology (IJEST), 4(5), 2395 - 2401.
YEAR: 2012
PUB TYPE: Journal Article
SUBJECT(S): Cutting Stock problem; trim loss optimization; Genetic Algorithm
DISCIPLINE: Engineering and Applied Sciences
HTTP: http://www.ijest.info/docs/IJEST12-04-05-303.pdf
LANGUAGE: English
PUB ID: 103-503-570 (Last edited on 2012/06/12 23:31:06 GMT-6)
SPONSOR(S):
 
ABSTRACT:
Minimizing the trim loss is one of the most common issues arising in the paper manufacturing industries and recently has been considered as one among the important research topics in industrial engineering. In the trim loss optimization problem, the machine will turn up with jumbos of constant size over which it is required to satisfy rolls of variable size and variable quantity as per customer requirement. Hence an optimal cutting plan has to be made so as to minimize the wastage or trim loss. This paper addresses the trim loss optimization problem by having a genetic algorithm approach. Numerical examples illustrate the efficiency and practicality of the proposed method. The objective is to produce a set of paper rolls from jumbo such that the trim loss is minimized. This can be considered as a cost minimization or as a profit maximization problem.
STATISTICS
Click on # to view
 Citations  
 References  
 Comments  
 Quality      0/0.00 
 Interest      0/0.00 
 View(er)s   1/57 
Quality
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Interest
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Prev | Next

    ABOUT getCITED   |    CONTACT US   |    USER INFO   |    PREFERENCES   |    PRIVACY   |    LOG IN   
Comments? Suggestions? Send them to feedback@getCITED.org.

Copyright © 2000-2013 getCITED Inc. All Rights Reserved.