Heuristic generation via parameter tuning for online bin packing

IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - EALS 2014: 2014 IEEE Symposium on Evolving and Autonomous Learning Systems, Proceedings

Volumn , Issue , 2014, Pages 102-108

  Yarimcam, Ahmet ^a   Asta, Shahriar ^a   Ozcan, Ender ^a   Parkes, Andrew J ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SOCIAL NETWORKING (ONLINE);

ONLINE BIN PACKING; PARAMETER TUNING ALGORITHM; PARAMETER-TUNING; PROBLEM-BASED;

BINS;

EID: 84946690827     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EALS.2014.7009510     Document Type: Conference Paper

References (37)

1. P. Cowling, G. Kendall, and E. Soubeiga, "A hyperheuristic approach to scheduling a sales summit, " in Practice and Theory of Automated Timetabling III, ser. Lecture Notes in Computer Science, E. Burke and W. Erben, Eds. Springer Berlin Heidelberg, 2001, vol. 2079, pp. 176-190.
2. W. Crowston, Probabilistic and Parametric Learning Combinations of Local Job Shop Scheduling Rules, ser. Research memorandum. Defense Technical Information Center, 1963.
3. H. Fisher and G. L. Thompson, "Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules, " pp. 225-251, 1963.
4. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. R. Woodward, "A classification of hyper-heuristic approaches, " in Handbook of Metaheuristics, ser. International Series in Operations Research & Management Science, M. Gendreau and J.-Y. Potvin, Eds. Springer US, 2010, vol. 146, pp. 449-468.
5. E. K. Burke, M. Gendreau, M. R. Hyde, G. Kendall, G. Ochoa, Ë. Ozcan, and R. Qu, "Hyper-heuristics: a survey of the state of the art, " JORS, vol. 64, no. 12, pp. 1695-1724, 2013.
6. O. Ulker, E. E. Korkmaz, and E. Ozcan, "A grouping genetic algorithm using linear linkage encoding for bin packing, " in Proceedings of the 10th International Conference on Parallel Problem Solving from Nature: PPSN X. Berlin, Heidelberg: Springer-Verlag, 2008, pp. 1140-1149.
7. P. Ross, "Hyper-heuristics, " in Search Methodologies, E. Burke and G. Kendall, Eds. Springer US, 2005, pp. 529-556.
8. E. K. Burke, T. Curtois, M. Hyde, G. Kendall, G. Ochoa, S. Petrovic, and J. A. Vazquez-Rodriguez, "HyFlex: A Flexible Framework for the Design and Analysis of Hyper-heuristics, " in Multidisciplinary International Scheduling Conference (MISTA 2009), Dublin, Ireland, Dublin, Ireland, 2009, pp. 790-797. [Online]. Available: http://www.asap.cs.nott.ac.uk/publications/pdf/MISTA09HyFlex.pdf
9. G. Ochoa, M. Hyde, T. Curtois, J. A. Vazquez-Rodriguez, J. Walker, M. Gendreau, G. Kendall, A. J. Parkes, S. Petrovic, and E. K. Burke, "Hyflex: A benchmark framework for cross-domain heuristic search, " in Proceedings of the 12th European Conference on Evolutionary Computation in Combinatorial Optimization, ser. EvoCOP'12. Berlin, Heidelberg: Springer-Verlag, 2012, pp. 136-147.
10. M. Misir, K. Verbeeck, P. D. Causmaecker, and G. V. Berghe, "A new hyper-heuristic as a general problem solver: An implementation in hyflex, " J. of Scheduling, vol. 16, no. 3, pp. 291-311, Jun. 2013.
11. E. Ozcan and A. J. Parkes, "Policy matrix evolution for generation of heuristics, " in Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, ser. GECCO '11. New York, NY, USA: ACM, 2011, pp. 2011-2018.
12. Gittins and J. Gittins "Bandit processes and dynamic allocation, " vol. 41(2), pp. 148-177, 1979.
13. P. Ross, J. G. Maŕin-Blázquez, S. Schulenburg, and E. Hart, "Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics, " in Proceedings of the 2003 International Conference on Genetic and Evolutionary Computation: PartII, ser. GECCO'03. Berlin, Heidelberg: Springer-Verlag, 2003, pp. 1295-1306.
14. E. K. Burke, M. R. Hyde, G. Kendall, and J. R. Woodward, "The scalability of evolved on line bin packing heuristics, " in 2007 IEEE Congress on Evolutionary Computation, D. Srinivasan and L. Wang, Eds., IEEE Computational Intelligence Society. Singapore: IEEE Press, 25-28 Sep. 2007, pp. 2530-2537.
15. E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward, "Automatic heuristic generation with genetic programming: Evolving a jack-of-all-trades or a master of one, " in Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, ser. GECCO '07. New York, NY, USA: ACM, 2007, pp. 1559-1565.
16. A. J. Parkes, E. Ozcan, and M. R. Hyde, "Matrix analysis of genetic programming mutation, " in Proceedings of the 15th European Conference on Genetic Programming, ser. EuroGP'12. Berlin, Heidelberg: Springer-Verlag, 2012, pp. 158-169.
17. M. López-Ibáñez, J. Dubois-Lacoste, T. Stützle, and M. Birattari, "The irace package, iterated race for automatic algorithm configuration, " IRIDIA, Université Libre de Bruxelles, Belgium, Tech. Rep. TR/IRIDIA/2011-004, 2011. [Online]. Available: http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2011-004.pdf
18. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co., 1990.
19. S. Asta, E. Ozcan, and A. J. Parkes, "Dimension reduction in the search for online bin packing policies, " in Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, ser. GECCO '13 Companion. New York, NY, USA: ACM, 2013, pp. 65-66.
20. S. Asta, E. Ozcan, A. Parkes, and A. Etaner-Uyar, "Generalizing hyper-heuristics via apprenticeship learning, " in Evolutionary Computation in Combinatorial Optimization, ser. Lecture Notes in Computer Science, M. Middendorf and C. Blum, Eds. Springer Berlin Heidelberg, 2013, vol. 7832, pp. 169-178.
21. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1st ed. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 1989.
22. B. Adenso-Diaz and M. Laguna, "Fine-tuning of algorithms using fractional experimental designs and local search, " Oper. Res., vol. 54, no. 1, pp. 99-114, Jan. 2006.
23. F. Hutter, D. Babic, H. H. Hoos, and A. J. Hu, "Boosting verification by automatic tuning of decision procedures, " in Proceedings of the Formal Methods in Computer Aided Design, ser. FMCAD '07. Washington, DC, USA: IEEE Computer Society, 2007, pp. 27-34.
24. A. KhudaBukhsh, L. Xu, H. Hoos, and K. Leyton-Brown, "SATenstein: Automatically Building Local Search SAT Solvers From Components, " in International Joint Conference on Artificial Intelligence (IJCAI 2009), 2009.
25. C. Fawcett, H. H. Hoos, and M. Chiarandini, "An automatically configured modular algorithm for post enrollment course timetabling, " University of British Columbia, Department of Computer Science, Tech. Rep., 2009.
26. C. Thachuk, A. Shmygelska, and H. Hoos, "A replica exchange monte carlo algorithm for protein folding in the hp model, " BMC Bioinfor-matics, vol. 8, no. 1, 2007.
27. P. Balaprakash, M. Birattari, and T. Stützle, "Improvement strategies for the f-race algorithm: Sampling design and iterative refinement, " in Hybrid Metaheuristics, ser. Lecture Notes in Computer Science, T. Bartz-Beielstein, M. Blesa Aguilera, C. Blum, B. Naujoks, A. Roli, G. Rudolph, and M. Sampels, Eds. Springer Berlin Heidelberg, 2007, vol. 4771, pp. 108-122.
28. M. Birattari, Z. Yuan, P. Balaprakash, and T. Sttzle, "F-race and iterated f-race: An overview, " in Experimental Methods for the Analysis of Optimization Algorithms, T. Bartz-Beielstein, M. Chiarandini, L. Paquete, and M. Preuss, Eds. Springer Berlin Heidelberg, 2010, pp. 311-336.
29. O. Maron and A. W. Moore, "The racing algorithm: Model selection for lazy learners, " Artif. Intell. Rev., vol. 11, no. 1-5, pp. 193-225, Feb. 1997.
30. M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp, "A racing algorithm for configuring metaheuristics, " in Proceedings of the Genetic and Evolutionary Computation Conference, ser. GECCO '02. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2002, pp. 11-18.
31. M. López-Ibáñez and T. Stützle, "The automatic design of multi-objective ant colony optimization algorithms, " IEEE Transactions on Evolutionary Computation, vol. 16, no. 6, pp. 861-875, Dec 2012.
32. M. Montes de Oca, D. Aydn, and T. Stützle, "An incremental particle swarm for large-scale continuous optimization problems: an example of tuning-in-the-loop (re)design of optimization algorithms, " Soft Computing, vol. 15, no. 11, pp. 2233-2255, 2011.
33. M. Chiarandini, M. Birattari, K. Socha, and O. Rossi-Doria, "An effective hybrid algorithm for university course timetabling, " Journal of Scheduling, vol. 9, no. 5, pp. 403-432, 2006.
34. F. Mascia, M. López-Ibáñez, J. Dubois-Lacoste, and T. Stützle, "Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, " Comput. Oper. Res., vol. 51, pp. 190-199, Nov. 2014.
35. M. López-Ibáñez and T. Stützle, "Automatically improving the anytime behaviour of optimisation algorithms, " European Journal of Operational Research, vol. 235, no. 3, pp. 569-582, 2014.
36. C. Thornton, F. Hutter, H. H. Hoos, and K. Leyton-Brown, "Auto-weka: Combined selection and hyperparameter optimization of classification algorithms, " in Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ser. KDD '13. New York, NY, USA: ACM, 2013, pp. 847-855.
37. M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann, and I. H. Witten, "The weka data mining software: An update, " SIGKDD Explor. Newsl., vol. 11, no. 1, pp. 10-18, Nov. 2009.