A MULTI-OBJECTIVE GENETIC ALGORITHM FOR CUTTING-STOCK IN PLASTIC ROLLS INDUSTRY

Ramiro Varela, César Muñoz, María Sierra, Inés González-Rodríguez

Abstract

In this paper, we confront a variant of the cutting-stock problem with multiple objectives. It is an actual problem of an industry that manufactures plastic rolls under customers’ demands. The starting point is a solution calculated by a heuristic algorithm, termed SHRP that aims mainly at optimizing the two main objectives, i.e. the number of cuts and the number of different patterns; then the proposed multi-objective genetic algorithm tries to optimize other secondary objectives such as changeovers, completion times of orders weighted by priorities and open stacks. We report experimental results showing that the multi-objective genetic algorithm is able to improve the solutions obtained by SHRP on the secondary objectives and also that it offers a number of non dominated solutions, so that the expert can chose one of them according to his preferences at the time of cutting the orders of a set of customers.

References

  1. Belov, G., Scheithauer, G. 2006b. Setup and Open Stacks Minimization in One-Dimensional Stock Cutting. (submited to INFORMS Journal of Computing).
  2. Gilmore, P. C., Gomory, R. E., 1961. A linear programming approach to the cutting stock problem. Operations Research 9, 849-859.
  3. Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.
  4. Mandow, L., Pérez-de-la-Cruz, J.L. 2005. A new approach to multiobjective A* search. IJCAI-05 19th Int. Joint Conf. on Artificial Intelligence, 218-223.
  5. Muñoz, C., 2006. A Multiobjective Evolutionary Algorithm to Compute Cutting Plans for Plastic Rolls. Degree project, University of Oviedo, School of Computing, Gijón (In Spanish).
  6. Puente, J., Sierra, M., González-Rodríguez, I., Vela, C. R., Alonso, C., Varela, R., 2005. An actual problem in optimizing plastic rolls cutting. Workshop on Planning, Scheuling and Temporal Reasoning, in CAEPIA 2005. Santiago de Compostela.
  7. Resende, M. G. C., Ribeiro, G. C., 2002. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberg eds. Handbook of Metaheuristics, p. 219-249. Kluwer Academic Publishers.
  8. Varela, R. Vela, C. R., Puente, J. Sierra, M. R. GonzálezRodríguez, I., 2007. An effective solution for an actual cutting stock problem in manufacturing plastic rolls. (submitted to Annals of Operations Research).
  9. Umetani, S. Yagiura, M., Ibaraki, T., 2003. Onedimensional cutting stock problem to minimize the number of different patterns. European Journal of Operational Research 146, 388-402.
  10. Zhou, G., Gen, M., 1999. Genetic algorithm approach on multi-criteria minimum spanning tree problem. European Journal of Operational Research 114, 141- 152.
Download


Paper Citation


in Harvard Style

Varela R., Muñoz C., Sierra M. and González-Rodríguez I. (2007). A MULTI-OBJECTIVE GENETIC ALGORITHM FOR CUTTING-STOCK IN PLASTIC ROLLS INDUSTRY . In Proceedings of the Second International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8111-05-0, pages 186-193. DOI: 10.5220/0001337201860193


in Bibtex Style

@conference{icsoft07,
author={Ramiro Varela and César Muñoz and María Sierra and Inés González-Rodríguez},
title={A MULTI-OBJECTIVE GENETIC ALGORITHM FOR CUTTING-STOCK IN PLASTIC ROLLS INDUSTRY},
booktitle={Proceedings of the Second International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2007},
pages={186-193},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001337201860193},
isbn={978-989-8111-05-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - A MULTI-OBJECTIVE GENETIC ALGORITHM FOR CUTTING-STOCK IN PLASTIC ROLLS INDUSTRY
SN - 978-989-8111-05-0
AU - Varela R.
AU - Muñoz C.
AU - Sierra M.
AU - González-Rodríguez I.
PY - 2007
SP - 186
EP - 193
DO - 10.5220/0001337201860193