{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:06:08Z","timestamp":1781103968369,"version":"3.54.1"},"reference-count":24,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4,1]]},"abstract":"<p>The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic using GRASP with Path-Relinking (HyGrasPr). HyGrasPr generates heuristic sequences to produce solutions within an iterative procedure. The procedure of HyGrasPr consists of three phases, namely the construction phase, the local search phase, and the path-relinking phase. To show the performance of the HyGrasPr, the authors use the nurse rostering problem as a case study. The authors use an existing simulated annealing based hyper-heuristic as a baseline. The experimental results indicate that HyGrasPr can achieve better solutions than SAHH within the same running time and the path-relinking phase is effective for the framework of HyGrasPr.<\/p>","DOI":"10.4018\/jitr.2011040103","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T11:24:13Z","timestamp":1319023453000},"page":"31-42","source":"Crossref","is-referenced-by-count":2,"title":["A Hyper-Heuristic Using GRASP with Path-Relinking"],"prefix":"10.4018","volume":"4","author":[{"given":"He","family":"Jiang","sequence":"first","affiliation":[{"name":"Dalian University of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junying","family":"Qiu","sequence":"additional","affiliation":[{"name":"Dalian University of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jifeng","family":"Xuan","sequence":"additional","affiliation":[{"name":"Dalian University of Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jitr.2011040103-0","unstructured":"Bai, R., Blazewicz, J., Burke, E. K., Kendall, G., & McCollum, B. (2007). A simulated annealing hyper-heuristic methodology for flexible decision support (Tech. Rep. No. NOTTCS-TR-2007-8). Nottingham, UK: University of Nottingham, School of Computer Science and Information Technology."},{"key":"jitr.2011040103-1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602463"},{"key":"jitr.2011040103-2","doi-asserted-by":"crossref","unstructured":"Bai, R., & Kendall, G. (2005). An investigation of automated planograms using a simulated annealing based hyper-heuristics. In T. Ibaraki, et al. (Eds.), Metaheuristics: Progress as a real problem solver (pp. 87\u2013108). Berlin, Germany: Springer. doi:10.1007\/0-387-25383-1_4","DOI":"10.1007\/0-387-25383-1_4"},{"key":"jitr.2011040103-3","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000046076.75950.0b"},{"key":"jitr.2011040103-4","unstructured":"Burke, E. K., Curtois, T., Qu, R., & Vanden-Berghe, G. (2008). Problem model for nurse rostering benchmark instances. Retrieved December 14, 2010, from http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/papers\/ANROM.pdf"},{"key":"jitr.2011040103-5","unstructured":"Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., & Qu, R. (2010). Hyper-heuristics: a survey of the state of the art (Tech. Rep. No. NOTTCS-TR-SUB-0906241418). Nottingham, UK: University of Nottingham, School of Computer Science and Information Technology."},{"key":"jitr.2011040103-6","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., & Woodward, J. R. (2010). A classification of hyper-heuristic approaches. In M. Gendreau & J. Potvin (Eds.), Handbook of metaheuristics (2nd ed., pp. 449\u2013468). Berlin, Germany: Springer. doi:10.1007\/978-1-4419-1665-5_15","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"jitr.2011040103-7","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","article-title":"Hyper-Heuristics: An emerging direction in modern search technology","author":"E. K.Burke","year":"2003","journal-title":"Handbook of metaheuristics"},{"key":"jitr.2011040103-8","unstructured":"Burke, E. K., Kendall, G., Silva, D. L., O\u2019Brien, R., & Soubeiga, E. (2005). An ant algorithm hyperheuristic for the project presentation scheduling problem. In Proceedings of the IEEE Conference on Evolutionary Computation (pp. 2263-2270). Washington, DC: IEEE Computer Society."},{"key":"jitr.2011040103-9","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"jitr.2011040103-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.07.036"},{"key":"jitr.2011040103-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.08.012"},{"key":"jitr.2011040103-12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"jitr.2011040103-13","author":"T.Curtois","year":"2010","journal-title":"A HyFlex module for the personnel scheduling problem"},{"key":"jitr.2011040103-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.03.058"},{"key":"jitr.2011040103-15","first-page":"1","article-title":"GRASP with path relinking for the weighted MAXSAT problem.","volume":"11","author":"P.Festa","year":"2006","journal-title":"Journal of Experimental Algorithmics"},{"key":"jitr.2011040103-16","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Qu, R., & Burke, E. K. (2009). Analyzing the landscape of a graph based hyper-heuristic for timetabling problems. In F. Rothlauf (Ed.), Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (pp. 341-348). New York, NY: ACM.","DOI":"10.1145\/1569901.1569949"},{"key":"jitr.2011040103-17","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2008.102"},{"key":"jitr.2011040103-18","doi-asserted-by":"crossref","unstructured":"Remde, S., Cowling, P. I., Dahal, K. P., & Colledge, N. (2006). Exact\/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling. In C. Cotta et al. (Eds.), Evolutionary computation in combinatorial optimization (LNCS 4446, pp. 188-197).","DOI":"10.1007\/978-3-540-71615-0_17"},{"key":"jitr.2011040103-19","doi-asserted-by":"crossref","unstructured":"Remde, S., Dahal, K. P., Cowling, P. I., & Colledge, N. (2009). Binary exponential back off for tabu tenure in hyperheuristics. In C. Cotta et al. (Eds.), Evolutionary computation in combinatorial optimization (LNCS 5482, pp. 109-120).","DOI":"10.1007\/978-3-642-01009-5_10"},{"key":"jitr.2011040103-20","doi-asserted-by":"crossref","unstructured":"Ren, Z., Jiang, H., Xuan, J., & Luo, Z. (2010). Ant based hyper heuristics with space reduction: A case study of the p-Median problem. In R. Schaefer et al. (Eds.), Proceedings of the Parallel Problem Solving from Nature Conference (PPSN XI) (LNCS 6238, pp. 546-555).","DOI":"10.1007\/978-3-642-15844-5_55"},{"key":"jitr.2011040103-21","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","article-title":"Greedy random adaptive search procedures","author":"M. G. C.Resende","year":"2003","journal-title":"Handbook of metaheuristics"},{"key":"jitr.2011040103-22","doi-asserted-by":"crossref","unstructured":"Ross, P., Marin-Blazquez, J. G., Schulenburg, S., & Hart, E. (2003). Learning a procedure that can solve hard bin-packing problems: A new GA-Based approach to hyper-heuristics. In E. Cant\u00fa-Paz et al. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003) (LNCS 2724, pp. 1295-1306).","DOI":"10.1007\/3-540-45110-2_5"},{"key":"jitr.2011040103-23","unstructured":"Terashima-Marin, H., Moran-Saavedra, A., & Ross, P. (2005). Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems. In Proceedings of the IEEE Conference on Evolutionary Computation (pp. 1104-1110). Washington, DC: IEEE Computer Society."}],"container-title":["Journal of Information Technology Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=52816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:10:27Z","timestamp":1654096227000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jitr.2011040103"}},"subtitle":["A Case Study of the Nurse Rostering Problem"],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jitr.2011040103","relation":{},"ISSN":["1938-7857","1938-7865"],"issn-type":[{"value":"1938-7857","type":"print"},{"value":"1938-7865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}