A heuristic and an exact method for the gate matrix connection cost minimization problem

International Transactions in Operational Research

Volumn 20, Issue 5, 2013, Pages 627-643

  De Giovanni, L ^a   Massi, G ^b   Pezzella, F ^b   Pfetsch, M E ^c   Rinaldi, G ^d   Ventura, P ^d  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

^c DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^d CNR   (Italy)

Author keywords

Branch and cut; Dynamic fitness function; Genetic algorithms; Integer linear programming; Maximum number of open stacks; Pattern sequencing; Time of open stacks

Indexed keywords

BRANCH-AND-CUT; DYNAMIC FITNESS FUNCTION; INTEGER LINEAR PROGRAMMING; OPEN STACKS; PATTERN SEQUENCING;

COMBINATORIAL OPTIMIZATION; COSTS; GENETIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION;

MATRIX ALGEBRA;

EID: 84881022755     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/itor.12025     Document Type: Article

References (26)

1. Achterberg, T., 2009. SCIP: solving constraint integer programs. Mathematical Programming Computation 1, 1, 1-41.
2. Baptiste, P., 2005. Simple MIP formulations to minimize the maximum number of open stacks. In Smith, B.M. and Gent, I.P. (eds), Proceedings of IJCAI'05-Constraint Modelling Challenge 2005, Edinburgh, pp. 9-13.
3. Becceneri, J.C., Yanasse, H.H., Soma, N.Y., 2004. A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Computers and Operations Research 31, 2315-2332.
4. Birattari, M., 2009. Tuning Metaheuristics: A Machine Learning Perspective, Vol. 197. Springer Verlag, Berlin.
5. Booth, K.S., Lueker, G.S., 1976. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer System Science 13, 335-379.
6. Chu, G., Stuckey, P.J., 2009. Minimizing the maximum number of open stacks by customer search. Lecture Notes in Computer Science 5732, 242-257.
7. De Giovanni, L., Massi, G., Pezzella, F., 2013. An adaptive genetic algorithm for large-size open stack problems. International Journal of Production Research 51, 3, 682-697.
8. Dyson, R., Gregory, A., 1974. The cutting stock problem in the flat glass industry. Operational Research Quarterly 25, 41-54.
9. Faggioli, E., Bentivoglio, C., 1998. Heuristic and exact methods for the cutting sequencing problem. European Journal of Operational Research 110, 3, 564-575.
10. Förster, H., Wäscher, G., 1998. Simulated annealing for order spread minimization problem in sequencing cutting patterns. European Journal of Operational Research 110, 271-281.
11. Hu, Y.H., Chen, S.J., 1990. GM_Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques. IEEE Transactions on Computer-Aided Design 9, 836-845.
12. Lin, S., Kernighan, B.W., 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21, 2, 498-516.
13. Linhares, A., Yanasse, H.H., 2002. Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Computers & Operations Research 29, 1759-1772.
14. Lopes, I.C., Valério de Carvalho, J.M., 2010. Using interval graphs in an order processing optimization problem. World Congress on Engineering WCE 2010, Vol. III. London, 30 June-2 July, 1722-1728.
15. Madsen, O., 1988. An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry. Journal of Operational Research Society 39, 249-256.
16. Möhring, R., 1990. Graph problems related to gate matrix layout and PLA folding. Computing 7, 17-51.
17. Oliveira, A.C.M., 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.
18. Oliveira, A.C.M., Lorena, L.A.N., 2006. Pattern sequencing problems by clustering search. Lecture Notes in Computer Science 4140, 218-227.
19. Oliver, I., Smith, D., Holland, J., 1987. A study of permutation crossover operators on the traveling salesman problem. Proceedings of the Second International Conference on Genetic Algorithms and Their Application, Cambridge, MA, pp. 224-230.
20. Oswald, M., Reinelt, G., 2003. Constructing new facets of the consecutive ones polytope. In Jünger, M., Reinelt, G., and Rinaldi, G. (eds) Combinatorial Optimization-Eureka, You Shrink! Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, 2001, Vol. 2570 of LNCS, Springer-Verlag, Berlin, pp. 147-157.
21. Oswald, M., Reinelt, G., 2004. Computing optimal consecutive ones matrices. In Grötschel, M. (ed.) The Sharpest Cut, The Impact of Manfred Padberg and His Work, Optimization, MPS/SIAM, Philadelphia, PA, pp. 173-184.
22. Respício, A., Captivo, M.E., 2005. Bi-objective sequencing of cutting patterns-an application for the paper industry. In Ibaraki, T., Nonobe, K., and Yagiura, M. (eds) Metaheuristics: Progress as Real Problem Solvers, Springer, New York, pp. 227-241.
23. SCOOP Team, 2009. Sheet cutting and process optimization for furniture industry-SCOOP Project. Available at http://www.scoop-project.net (accessed May 27, 2013).
24. Smith, B. M., Gent, I. P. (eds), 2005. Proceedings of IJCAI'05-Constraint Modelling Challenge 2005, Edinburgh.
25. Tucker, A., 1972. A structure theorem for the consecutive 1's property. Journal of Combinatorial Theory Series B 12, 153-162.
26. Yuen, B.J., 1995. Improved heuristics for sequencing cutting patterns. European Journal of Operational Research 87, 1, 57-64.