Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 706350, 8 pages
http://dx.doi.org/10.1155/2013/706350
Research Article

Trim Loss Optimization by an Improved Differential Evolution

1Department of Computer Engineering, Sungkyunkwan University, Suwon 440746, Republic of Korea
2Department of Applied Science and Engineering, IIT Roorkee, Roorkee 247667, India

Received 10 April 2013; Accepted 24 June 2013

Academic Editor: Alexander P. Seyranian

Copyright © 2013 Musrrat Ali et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. A. Rodríguez and A. Vecchietti, “Enterprise optimization for solving an assignment and trim-loss non-convex problem,” Computers and Chemical Engineering, vol. 32, no. 11, pp. 2812–2822, 2008. View at Publisher · View at Google Scholar · View at Scopus
  2. H. Dyckhoff, “A typology of cutting and packing problems,” European Journal of Operational Research, vol. 44, no. 2, pp. 145–159, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. G. Wäscher, H. Haußner, and H. Schumann, “An improved typology of cutting and packing problems,” European Journal of Operational Research, vol. 183, no. 3, pp. 1109–1130, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. I. Harjunkoski, T. Westerlund, J. Isaksson, and H. Skrifvars, “Different formulations for solving trim loss problems in a paper-converting mill with ILP,” Computers and Chemical Engineering, vol. 20, no. 1, pp. S121–S126, 1996. View at Google Scholar · View at Scopus
  5. I. Harjunkoski, T. Westerlund, and R. Pörn, “Numerical and environmental considerations on a complex industrial mixed integer non-linear programming (MINLP) problem,” Computers and Chemical Engineering, vol. 23, no. 10, pp. 1545–1561, 1999. View at Publisher · View at Google Scholar · View at Scopus
  6. P. Trkman and M. Gradisar, “One-dimensional cutting stock optimization in consecutive time periods,” European Journal of Operational Research, vol. 179, no. 2, pp. 291–301, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. I. Harjunkoski, T. Westerlund, R. Pörn, and H. Skrifvars, “Different transformations for solving non-convex trim-loss problems by MINLP,” European Journal of Operational Research, vol. 105, no. 3, pp. 594–603, 1998. View at Google Scholar · View at Scopus
  8. R. E. Johnston and E. Sadinlija, “A new model for complete solutions to one-dimensional cutting stock problems,” European Journal of Operational Research, vol. 153, no. 1, pp. 176–183, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. M. H. Correia, J. F. Oliveira, and S. Ferreira, “Reel and sheet cutting at a paper mill,” Computers and Operations Research, vol. 31, no. 8, pp. 1223–1243, 2004. View at Publisher · View at Google Scholar · View at Scopus
  10. A. I. Hinxman, “The trim-loss and assortment problems: a survey,” European Journal of Operational Research, vol. 5, no. 1, pp. 8–18, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. P. C. Gilmore and R. E. Gomory, “A linear programming approach to the cutting-stock problem,” Operations Research, vol. 9, pp. 849–859, 1961. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. R. W. Haessler, “A heuristic programming solution to a non-linear cutting stock problem,” Management Science, vol. 17, pp. 793–802, 1971. View at Google Scholar
  13. I. Coverdale and F. Wharton, “An improved heuristic procedure for a nonlinear cutting stock problem,” Management Science, vol. 23, no. 1, pp. 78–86, 1976. View at Google Scholar · View at Scopus
  14. J. E. Beasley, “A population heuristic for constrained two-dimensional non-guillotine cutting,” European Journal of Operational Research, vol. 156, no. 3, pp. 601–627, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. J. Riehme, G. Scheithauer, and J. Terno, “The solution of two-stage guillotine cutting stock problems having extremely varying order demands,” European Journal of Operational Research, vol. 91, no. 3, pp. 543–552, 1996. View at Publisher · View at Google Scholar · View at Scopus
  16. T. Westerlund, “Some efficient formulations for the simultaneous solution of trim-loss and scheduling problems in the paper-converting industry,” Chemical Engineering Research and Design, vol. 76, no. 6, pp. 677–684, 1998. View at Publisher · View at Google Scholar · View at Scopus
  17. R. Alvarez-Valdés, A. Parajón, and J. M. Tamarit, “A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems,” Computers and Operations Research, vol. 29, no. 7, pp. 925–947, 2002. View at Publisher · View at Google Scholar · View at Scopus
  18. K. K. Lai and J. W. M. Chan, “Developing a simulated annealing algorithm for the cutting stock problem,” Computers and Industrial Engineering, vol. 32, no. 1, pp. 115–127, 1997. View at Google Scholar · View at Scopus
  19. S. Xianjun, Y. Li, B. Zheng, and Z. Dai, “General particle swarm optimization based on simulated annealing for multi-specification one-dimensional cutting stock problem,” in Proceedings of the IEEE International Conference on Cybernetics and Intelligent Systems (CIS '06), vol. 4456 of Lecture Notes in Computer Science, pp. 67–76, Guangzhou, China, 2007.
  20. K. Deep, P. Chauhan, and J. C. Bansal, “Solving nonconvex trim loss problem using an efficient hybrid particle swarm optimization,” in Proceedings of the World Congress on Nature and Biologically Inspired Computing (NABIC '09), pp. 1608–1611, Coimbatore, India, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. K. Deep, P. Chauhan, and M. Pant, “New hybrid discrete PSO for solving non convex trim loss problem,” International Journal of Applied Evolutionary Computation, vol. 3, no. 2, pp. 19–41, 2012. View at Google Scholar
  22. B. J. Wagner, “Genetic algorithm solution for one-dimensional bundled stock cutting,” European Journal of Operational Research, vol. 117, no. 2, pp. 368–381, 1999. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Östermark, “Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm,” Computers and Operations Research, vol. 26, no. 6, pp. 623–635, 1999. View at Publisher · View at Google Scholar · View at Scopus
  24. M. Ali, M. Pant, and A. Abraham, “Improving differential evolution algorithm by synergizing different improvement mechanisms,” ACM Transaction on Autonomous and Adaptive Systems, vol. 7, no. 2, pp. 1–32, 2012. View at Google Scholar
  25. R. Storn and K. Price, “Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. M. Ali, M. Pant, and A. Abraham, “Simplex differential evolution,” Acta Polytechnica Hungarica, vol. 6, no. 5, pp. 95–115, 2009. View at Google Scholar · View at Scopus
  27. R. S. Rahnamayan, H. R. Tizhoosh, and M. M. A. Salama, “Opposition-based differential evolution,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 1, pp. 64–79, 2008. View at Publisher · View at Google Scholar · View at Scopus
  28. C. S. Adjiman, I. P. Androulakis, and C. A. Floudas, “Global optimization of mixed-integer nonlinear problems,” AIChE Journal, vol. 46, no. 9, pp. 1769–1797, 2000. View at Google Scholar · View at Scopus
  29. C. H. Yen, D. S. H. Wong, and S. S. Jang, “Solution of trim-loss problem by an integrated simulated annealing and ordinal optimization approach,” Journal of Intelligent Manufacturing, vol. 15, no. 5, pp. 701–709, 2004. View at Publisher · View at Google Scholar · View at Scopus
  30. M. Srinivas and G. P. Rangaiah, “Differential evolution with tabu list for solving nonlinear and mixed-integer nonlinear programming problems,” Industrial and Engineering Chemistry Research, vol. 46, no. 22, pp. 7126–7135, 2007. View at Publisher · View at Google Scholar · View at Scopus
  31. R. Angira and B. V. Babu, “Optimization of process synthesis and design problems: a modified differential evolution approach,” Chemical Engineering Science, vol. 61, no. 14, pp. 4707–4721, 2006. View at Publisher · View at Google Scholar · View at Scopus
  32. K. Deb, “An efficient constraint handling method for genetic algorithms,” Computer Methods in Applied Mechanics and Engineering, vol. 186, no. 2-4, pp. 311–338, 2000. View at Google Scholar · View at Scopus