Rong Qu
Chinese and British computer scientist
Rong Qu is a Chinese and British computer scientist whose research focuses on hyper-heuristics, the application of machine learning in choosing among multiple heuristic solutions to computational search problems, especially as applied to problems in scheduling, portfolio optimisation, and vehicle routing. She is a professor of computer science at the University of Nottingham.
Education and career
Qu received a bachelor's degree with honours in computer science from Xidian University in 1996. She came to the UK for graduate study at the University of Nottingham, where she completed her Ph.D. in 2002. Her dissertation, Case-Based Reasoning for Course Timetabling Problems, was supervised by Edmund K. Burke.
She stayed at the University of Nottingham for postdoctoral research from 2001 to 2005, and then as a lecturer beginning in 2005. She was promoted to associate professor in 2013 and to professor in 2023.
Books
Qu is a coauthor, with Nelishia Pillay, of the books Hyper-Heuristics: Theory and Applications (Springer, 2018) and Advances in Hyper-Heuristics (Springer, 2025). She and Pillay are co-editors of Automated Design of Machine Learning and Search Algorithms (Springer, 2021).
Recognition
Qu was named to the 2026 class of IEEE Fellows, "for contributions to automated evolutionary algorithms in combinatorial optimisation".
“Rong Qu” enters the record as chinese and British computer scientist. Crown Archives preserves that source wording while asking what Rong, Chinese and British can confirm, complicate or overturn.
Why this record matters
“Rong Qu” is worth following because a concise public description often conceals a longer documentary argument. Here, Rong, Chinese and British provides the most credible route into that argument.
Biographical claims are most persuasive when dates, appointments and relationships can be traced to records created close to the events described. The source revision retrieved here is dated Jan 26, 2026. The linked authority identifier is Q57551422. VIAF identifies the subject as 44229211. The Library of Congress control number is nr2001033774. 2 of 3 selected statements include explicit references; 0 carry qualifiers and 0 use preferred rank. The first chronological checks are 1996, 2002, 2001 and 2005.
Public reputation and documentary evidence do not always develop together; absence from a summary is not evidence of historical absence. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Read biographical claims against dates, named institutions and the cited references. Distinguish a subject’s later reputation from evidence produced during their lifetime.
- Establishing names and roles
- Building a first chronology
- Locating cited institutions
Personal papers, civil or court records, institutional files and the scholarship cited by the source.
Three-step research path
- Establish the record: confirm the title “Rong Qu”, its source revision and the description used here.
- Expand the search: follow Rong Qu primary sources, Rong Qu archive and Rong research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Rong Qu”?
- Which primary records establish identity, chronology and institutional ties?
- Which claims depend on a single source or contested interpretation?
Search terms from this dossier
This entry incorporates text from “Rong Qu” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.