@inproceedings{37249019153,
    abstract = "In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyper heuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators parameter values. The results obtained are very encouraging and have improved the results from both the single heuristics and the single hyperheuristics' tests. Thus, we conclude that the collaboration among hyperheuristics is a good way to solve hard strip packing problems. © Springer-Verlag Berlin Heidelberg 2007.",
    year = "2007",
    title = "Collaboration between hyperheuristics to solve strip-packing problems",
    volume = "4529 LNAI",
    pages = "698-707",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"
}

{"_id":"bAjSN7ozHbBRZTBiy","bibbaseid":"anonymous-collaborationbetweenhyperheuristicstosolvestrippackingproblems-2007","downloads":0,"creationDate":"2017-03-31T20:15:32.994Z","title":"Collaboration between hyperheuristics to solve strip-packing problems","author_short":null,"year":2007,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyper heuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators parameter values. The results obtained are very encouraging and have improved the results from both the single heuristics and the single hyperheuristics' tests. Thus, we conclude that the collaboration among hyperheuristics is a good way to solve hard strip packing problems. © Springer-Verlag Berlin Heidelberg 2007.","year":"2007","title":"Collaboration between hyperheuristics to solve strip-packing problems","volume":"4529 LNAI","pages":"698-707","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","bibtex":"@inproceedings{37249019153,\n abstract = \"In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyper heuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators parameter values. The results obtained are very encouraging and have improved the results from both the single heuristics and the single hyperheuristics' tests. Thus, we conclude that the collaboration among hyperheuristics is a good way to solve hard strip packing problems. © Springer-Verlag Berlin Heidelberg 2007.\",\n year = \"2007\",\n title = \"Collaboration between hyperheuristics to solve strip-packing problems\",\n volume = \"4529 LNAI\",\n pages = \"698-707\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\"\n}\n\n","key":"37249019153","id":"37249019153","bibbaseid":"anonymous-collaborationbetweenhyperheuristicstosolvestrippackingproblems-2007","urls":{},"downloads":0,"html":""},"search_terms":["collaboration","between","hyperheuristics","solve","strip","packing","problems"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}