A unified hyper-heuristic framework for solving bin packing problems |
| |
| Affiliation: | 1. Tecnológico de Monterrey, Av. E. Garza Sada 2501, Monterrey, NL 64849, Mexico;2. School of Computing, Edinburgh Napier University, Edinburgh EH10 5DT, UK;3. Computing Science and Mathematics, University of Stirling, Scotland, UK;1. Department of Management and Marketing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Special Administrative Region;2. Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Special Administrative Region;1. Department of Electrical and Computer Engineering, University of Macau, Avenida Padre Tomas Pereira, Taipa, Macau;2. Department of Computer Science, Huizhou University, Huizhou 516007, China;1. Department of Electrical Engineering, Federal University of Minas Gerais, Belo Horizonte, Brazil;2. Department of Computer Science, Federal University of Ouro Preto, Ouro Preto, Brazil;3. IT Center, Federal University of Ouro Preto, Ouro Preto, Brazil |
| |
| Abstract: | One- and two-dimensional packing and cutting problems occur in many commercial contexts, and it is often important to be able to get good-quality solutions quickly. Fairly simple deterministic heuristics are often used for this purpose, but such heuristics typically find excellent solutions for some problems and only mediocre ones for others. Trying several different heuristics on a problem adds to the cost. This paper describes a hyper-heuristic methodology that can generate a fast, deterministic algorithm capable of producing results comparable to that of using the best problem-specific heuristic, and sometimes even better, but without the cost of trying all the heuristics. The generated algorithm handles both one- and two-dimensional problems, including two-dimensional problems that involve irregular concave polygons. The approach is validated using a large set of 1417 such problems, including a new benchmark set of 480 problems that include concave polygons. |
| |
| Keywords: | Bin packing problems Evolutionary computation Hyper-heuristics Heuristics Optimization |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
