A memetic algorithm and a parallel hyperheuristic island-based model for a 2D packing problem

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 1371-1378

  Leon, Coromoto ^a   Miranda, Gara ^a   Segura, Carlos ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Cutting and packing problems; Hyperheuristics; Island based models; Memetic algorithms

Indexed keywords

2-D PACKING; ADAPTIVE BEHAVIOR; COMPUTATIONAL RESOURCES; COMPUTATIONAL RESULTS; CUTTING AND PACKING PROBLEM; HYBRID ALGORITHMS; HYPER-HEURISTICS; HYPERHEURISTIC; LOCAL SEARCH; MEMETIC ALGORITHMS; PARALLEL MODELS; VARIATION OPERATOR;

EVOLUTIONARY ALGORITHMS; GENETIC PROGRAMMING; MATHEMATICAL OPERATORS; PARALLEL ALGORITHMS;

MATHEMATICAL MODELS;

EID: 72749091692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1570085     Document Type: Conference Paper

References (33)

1. E. Alba. Parallel Metaheuristics: A New Class of Algorithms. Wiley-Interscience, 2005.
2. J. Arabas, Z. Michalewicz, and J. Mulawka. GAVaPS-a genetic algorithm with varying population size. In IEEE Conference on Evolutionary Computation, volume 1, pages 73-78, June 1994.
3. K. J. Binkley and M. Hagiwara. Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic. European Journal of Operational Research, 183(3):1230-1248, December 2007.
4. J. Blazewicz and R. Walkowiak. A new parallel approach for multi-dimensional packing problem. In 4th International Conference on Parallel Processing and Applied Mathematics (PPAM), volume 2328 of LNCS, pages 194-201. Naleczow, Poland, Springer Berlin, September 2002.
5. C. Blum and A. Roli. Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys, 35(3):268-308, 2003.
6. E. K. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg. Handbook of Meta-heuristics. Kluwer, 2003.
7. E. K. Burke, J. D. L. Silva, and E. Soubeiga. Hyperheuristic Approaches for Multiobjective Optimisation. In 5th Metaheuristics International Conference (MIC 2003), pages 11.1-11.6, 2003.
8. C. L. Li and Z.L. Chen. Binpacking Problem with Concave Costs of Bin Utilization. Naval Research Logistics, 53:298-308, 2006.
9. E. Cantú-Paz. A survey of parallel genetic algorithms. Technical report, IlliGAL 97003. University of Illinois at Urbana-Champaign, 1997.
10. M. Crepinsek, M. Mernik, and V. Zumer. A Metaevolutionary Approach for the Traveling Salesman Problem. In Int. Conf. Information Technology Interfaces, pages 357-362, 2000.
11. J. Demšar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006.
12. T. Dereli and G. S. Das. A hybrid simulated-annealing algorithm for two-dimensional strip packing problem. In 8th International Conference on Adaptive and Natural Computing Algorithms, volume 4431 of LNCS, pages 508-516. Warsaw, Poland, Springer Berlin, April 2007.
13. H. Dyckhoff. A Typology of Cutting and Packing Problems. European Journal of Operational Research, 44(2):145-159, 1990.
14. T.-P. Hong, M.-W. Tsai, and T.-K. Liu. Two-dimentional encoding schema and genetic operators. In JCIS. Atlantis Press, 2006.
15. H. H. Hoos. On the run-time behavior of stochastic local search algorithms for SAT. In Proceedings of AAAI'99, pages 661-666. MIT Press, 1999.
16. C. León, G. Miranda, C. Rodríguez, and C. Segura. 2D Cutting Stock Problem: A New Parallel Algorithm and Bounds. In Proceedings of Euro-Par, volume 4641 of LNCS, pages 795-804. Springer-Verlag, 2007.
17. C. León, G. Miranda, and C. Segura. Parallel hyperheuristic: a self-adaptive island-based model for multi-objective optimization. In GECCO'08: Proceedings of the 10th annual Conference on Genetic and Evolutionary Computation, pages 757-758, New York, NY, USA, 2008. Atlanta, GA, USA, ACM.
18. F. Luna, C. Estébanez, C. León, J. M. Chaves- González, E. Alba, R. Aler, C. Segura, M. A. Vega-Rodríguez, A. J. Nebro, J. M. Valls, G. Miranda, and J. A. Gómez-Pulido. Metaheuristics for solving a real-world frequency assignment problem in GSM networks. In GECCO'08: Proceedings of the 10th annual Conference on Genetic and Evolutionary Computation, pages 1579-1586, New York, NY, USA, 2008. Atlanta, GA, USA, ACM.
19. S. Martello, M. Monaci, and D. Vigo. An exact approach to the strip-packing problem. INFORMS Journal on Computing, 15(3):310-319, 2003.
20. Martello, S. and Toth, P. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons Ltd, 1990.
21. H. Mauch. Closest Substring Problem - Results from an Evolutionary Algorithm. In 11th International Conference on Neural Information Processing (ICONIP), volume 3316 of LNCS, pages 205-211, Calcutta, India, 2004. Springer.
22. Y.-S. Ong, M.-H. Lim, N. Zhu, and K. W. Wong. Classification of adaptive memetic algorithms: a comparative study. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 36(1):141-152, 2006.
23. C. Reeves. Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, 63:371-396, 1996.
24. C. Segura, A. Cervantes, A. J. Nebro, M. D. Jaraíz-Simón, E. Segredo, S. García, F. Luna, J. A. Gómez-Pulido, G. Miranda, C. Luque, E. Alba, M. A. Vega-Rodríguez, C. León, and I. M. Galván. Optimizing the DFCN Broadcast Protocol with a Parallel Cooperative Strategy of Multi-Objective Evolutionary Algorithms. In 5th International Conference on Evolutionary Multi-Criterion Optimization (EMO'2009) (to appear). Nantes, France, April 2009.
25. D. Sheskin. The handbook of parametric and nonparametric statistical procedures. CRC Press, 2003.
26. Y. Shil and D. Ye. On-line bin packing with arbitrary release times. In First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, volume 4614 of LNCS, pages 340-349. Hangzhou, China, Springer Berlin, April 2007.
27. M. Snir, S. W. Otto, S. Huss-Lederman, D. W. Walker, and J. J. Dongarra. MPI: The Complete Reference. The MIT Press, 1996.
28. A. Stawowy. Evolutionary based heuristic for bin packing problem. Comput. Ind. Eng., 55(2):465-474, 2008.
29. K. V. Viswanathan and A. Bagchi. Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems. Operations Research, 41(4):768-776, 1993.
30. D. Whitley. An overview of evolutionary algorithms: Practical issues and common pitfalls. Information and Software Technology, 43:817-831, 2001.
31. D. Wolpert and W. Macready. No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation, 1(67), 1997.
32. G. Wäscher, H. Haußner, and H. Schumann. An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3):1109-1130, December 2007.
33. B. Yuan and M. R. Gallagher. A Hybrid Approach to Parameter Tuning in Genetic Algorithms. In Congress on Evolutionary Computation, volume 1, pages 1096-1103. IEEE Press, 2005.