An adaptive genetic algorithm for large-size open stack problems

International Journal of Production Research

Volumn 51, Issue 3, 2013, Pages 682-697

  De Giovanni, L ^a   Massi, G ^b   Pezzella, F ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

combinatorial optimisation; genetic algorithms; minimisation of open stacks; production planning; sequencing

Indexed keywords

ADAPTIVE GENETIC ALGORITHMS; ADAPTIVE SEARCH; CIRCUIT DESIGNS; CIRCUIT GATES; COMPUTATIONAL TESTS; CUTTING PATTERNS; DYNAMIC FITNESS FUNCTION; GENETIC APPROACH; GENETIC OPERATORS; MINIMISATION OF OPEN STACKS; NEIGHBOURHOOD SEARCH; ORDER CROSSOVER; PRODUCTION PLANNING; SEARCH LANDSCAPES; SEQUENCING; STATE OF THE ART;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; PLANNING; PRODUCTION ENGINEERING;

PRODUCTION CONTROL;

EID: 84871203028     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2012.657256     Document Type: Article

References (29)

1. Adenso-Diaz, B. and Laguna, M., 2006. Fine-tuning of algorithms using fractional experimental designs and local search. Operations Research, 54 (3), 99-114.
2. Andreatta, G., et al., 1989. Un problema min cutwidth generalizzato e sue applicazioni ad un FMS (A generalized min cutwidth problem and applications to FMS). Atti delle giornate di lavoro AIRO, 1-17, (in Italian).
3. Bagchi, T. and Deb, K., 1996. Calibration of GA parameters: the design of experiments approach. Computer Science and Informatic, 26 (3), 46-56.
4. Baptiste, P., 2005. Simple MIP formulations to minimize the maximum number of open stacks. IJCAI'05-Constraint modelling challenge. Edinburgh, 9-13.
5. Becceneri, J.C., Yanasse, H.H., and Soma, N.Y., 2004. A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Computers & Operations Research, 31 (14), 2315-2332.
6. Birattari, M., 2009. Tuning metaheuristics: a machine learning perspective. Vol. 197, Berlin: Springer.
7. Chu, G. and Stuckey, P.J., 2009. Minimizing the maximum number of open stacks by customer search. Lecture Notes in Computer Science, 5732, 242-257.
8. De Giovanni, L., Massi, G., and Pezzella, F., 2010. Preliminary computational experiments with a genetic algorithm for the open stacks problem [online], Available from: http://www.math.unipd.it/-luigi/manuscripts/201009- AGA-compPrel.pdf [Accessed 4 October 2011].
9. De Giovanni, L., et al., 2011. A heuristic and an exact method for pattern sequencing problems. In: Proceedings of the VII ALIO/EURO workshop on applied combinatorial optimization. Porto, Portugal.
10. de Landgraaf, W., Eiben, A., and Nannen, V., 2007. Parameter calibration using meta-algorithms. In: Proceedings of CEC 2007-IEEE congress on evolutionary computation, 71-78. (Pubitemid 351371384)
11. de Oliveira, A.C.M. and Lorena, L.A.N., 2002. A constructive genetic algorithm for gate matrix layout problems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 21 (8), 969-974.
12. de Oliveira, A.C.M. and Lorena, L.A.N., 2005. Population training heuristics. Lecture Notes in Computer Science, 3448, 166-176. (Pubitemid 41273998)
13. de Oliveira, A.C.M. and Lorena, L.A.N., 2006. Pattern sequencing problems by clustering search. Lecture Notes in Computer Science, 4140, 218-227. (Pubitemid 44812271)
14. Eiben, E., Hinterding, R., and Michalewicz, Z., 1999. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3 (2), 124-141.
15. Faggioli, E. and Bentivoglio, C.A., 1998. Heuristic and exact methods for the cutting sequencing problem. European Journal of Operational Research, 110 (3), 564-575. (Pubitemid 128386942)
16. Fink, A. and Voß, S., 1999. Application of modern heuristic search methods to pattern sequencing problem. Computers & Operations Research, 26 (1), 17-34. (Pubitemid 29346485)
17. Garcia de la Banda, M. and Stuckey, P., 2007. Dynamic programming to minimize the maximum number of open stacks. INFORMS Journal on Computing, 19 (4), 607-617.
18. Hu, Y.H. and Chen, S.J., 1990. GM-Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques. IEEE Transactions on Computer-Aided Design, 9 (8), 836-845.
19. Lessmann, S., Caserta, M., and Montalvo Arango, I., 2011. Tuning metaheuristics: a data mining based approach for particle swarm optimization. Expert Systems with Applications, 38 (10), 12826-12838.
20. Lin, S. and Kernighan, B.W., 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21 (2), 498-516.
21. Linhares, A. and Yanasse, H.H., 2002. Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Computers & Operations Research, 29 (12), 1759-1772. (Pubitemid 34593114)
22. Lopes, I.C. and Valério de Carvalho, J.M., 2010. Using interval graphs in an order processing optimization problem. In: Proceedings of the world congress on engineering WCE 2010, Vol. III.
23. Mendes, A. and Linhares, A., 2004. A multiple-population evolutionary approach to gate matrix layout. International Journal of System Science, 35 (1), 13-23.
24. Miller, A., 2005. Improved lower bounds for solving the minimal open stacks problem. IJCAI'05 fifth workshop on modelling and solving problems with constraints. Edinburgh, 36-43.
25. SCOOP Team, 2009. Sheet cutting and process optimization for furniture industry-SCOOP project [online]. Available from: http://www.scoop-project.net [Accessed 4 October 2011].
26. Smith, B. and Gent, I., 2005. IJCAI'05-Constraint modelling challenge 2005. Edinburgh.
27. Yanasse, H.H. and Senne, E.L.F., 2010. The minimization of open stacks problem: a review of some properties and their use in pre-processing operations. European Journal of Operational Research, 203 (3), 559-567.
28. Yuen, B.J., 1995. Improved heuristics for sequencing cutting patterns. European Journal of Operational Research, 87 (1), 57-64.
29. Yuen, B.J. and Richardson, K.V., 1995. Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research, 84 (3), 590-598.