World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
48
Citations
12367
World Ranking
6079
National Ranking
368

Overview

Rong Qu is affiliated with the University of Nottingham in the United Kingdom. Their research spans primarily the fields of Computer Science and Engineering, with a focus on several key subfields that include Artificial Intelligence, Industrial and Manufacturing Engineering, Computer Vision and Pattern Recognition, Signal Processing, and Computer Networks and Communications.

The main topics of their work cover a broad range of areas in optimization, machine learning, and data analysis. These topics include:

  • Vehicle Routing Optimization Methods
  • Metaheuristic Optimization Algorithms Research
  • Optimization and Packing Problems
  • Maritime Ports and Logistics
  • Time Series Analysis and Forecasting
  • Anomaly Detection Techniques and Applications
  • Advanced Multi-Objective Optimization Algorithms

Rong Qu has published numerous papers in a variety of academic venues. Frequent publication venues include:

  • arXiv (Cornell University)
  • Expert Systems with Applications
  • IEEE Transactions on Evolutionary Computation
  • SSRN Electronic Journal
  • Scientific Reports

Some of the recent papers authored or coauthored by Rong Qu are:

  • Anti-Inflammatory and Intestinal Microbiota Modulation Properties of Jinxiang Garlic (Allium sativum L.) Polysaccharides toward Dextran Sodium Sulfate-Induced Colitis (2020, Journal of Agricultural and Food Chemistry)
  • An Efficient Federated Distillation Learning System for Multitask Time Series Classification (2022, IEEE Transactions on Instrumentation and Measurement)
  • Deep Contrastive Representation Learning With Self-Distillation (2023, IEEE Transactions on Emerging Topics in Computational Intelligence)
  • Densely Knowledge-Aware Network for Multivariate Time Series Classification (2024, IEEE Transactions on Systems Man and Cybernetics Systems)
  • CapMatch: Semi-Supervised Contrastive Transformer Capsule With Feature-Based Knowledge Distillation for Human Activity Recognition (2023, IEEE Transactions on Neural Networks and Learning Systems)

Rong Qu has collaborated frequently with several researchers, including:

  • Ruibin Bai
  • Huanlai Xing
  • Zhiwen Xiao
  • Xinan Chen
  • Chunbo Chen

In addition to journal papers, Rong Qu has a book published by Springer Science+Business Media entitled Automated Design of Machine Learning and Search Algorithms (2021).

Best Publications

  • Hyper-heuristics: a survey of the state of the art

    Edmund K. Burke;Michel Gendreau;Matthew R. Hyde;Graham Kendall

  • A Survey of Deep Learning-Based Object Detection

    Licheng Jiao;Fan Zhang;Fang Liu;Shuyuan Yang

  • A Graph-Based Hyper-Heuristic for Educational Timetabling Problems

    Edmund K. Burke;Barry McCollum;Amnon Meisels;Sanja Petrovic

  • A survey of search methodologies and automated system development for examination timetabling

    R. Qu;E. K. Burke;B. Mccollum;L. T. Merlot

  • Case-based heuristic selection for timetabling problems

    Edmund K. Burke;Sanja Petrovic;Rong Qu

  • Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition

    Barry McCollum;Andrea Schaerf;Ben Paechter;Paul McMullan

  • 2015 IEEE Symposium Series on Computational Intelligence

    Honorary Chairs;Jacek Zurada;Andries Engelbrecht;Mengjie Zhang

  • A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems

    Edmund K. Burke;Jingpeng Li;Rong Qu

  • A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem

    Edmund K. Burke;Timothy Curtois;Gerhard F. Post;Rong Qu

  • Personnel scheduling: Models and complexity

    Peter Brucker;Rong Qu;Edmund K. Burke

  • Workforce scheduling and routing problems: literature survey and computational study

    J. Arturo Castillo-Salazar;Dario Landa-Silva;Rong Qu

  • Hybrid variable neighbourhood approaches to university exam timetabling

    Edmund Burke;Adam J Eckersley;Barry McCollum;Sanja Petrovic

  • A learning-guided multi-objective evolutionary algorithm for constrained portfolio optimization

    Khin Lwin;Rong Qu;Graham Kendall

  • Mean-VaR portfolio optimization: A nonparametric approach

    Khin T. Lwin;Rong Qu;Bart L. MacCarthy

  • Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems

    Rong Qu;Edmund K. Burke

  • Hyper-Heuristics: Theory and Applications

    Nelishia Pillay;Rong Qu

  • A scatter search methodology for the nurse rostering problem

    E K Burke;T Curtois;R Qu;G Vanden Berghe

  • A Dynamic Multiarmed Bandit-Gene Expression Programming Hyper-Heuristic for Combinatorial Optimization Problems

    Nasser R. Sabar;Masri Ayob;Graham Kendall;Rong Qu

  • A graph coloring constructive hyper-heuristic for examination timetabling problems

    Nasser R. Sabar;Masri Ayob;Rong Qu;Graham Kendall

  • Grammatical Evolution Hyper-Heuristic for Combinatorial Optimization Problems

    Nasser R. Sabar;Masri Ayob;Graham Kendall;Rong Qu

  • A shift sequence based approach for nurse scheduling and a new benchmark dataset

    Peter Brucker;Edmund K. Burke;Tim Curtois;Rong Qu

  • A honey-bee mating optimization algorithm for educational timetabling problems

    Nasser R. Sabar;Masri Ayob;Graham Kendall;Rong Qu

  • Analyzing the landscape of a graph based hyper-heuristic for timetabling problems

    Gabriela Ochoa;Rong Qu;Edmund K. Burke

  • Discrete Optimization A graph-based hyper-heuristic for educational timetabling problems

    Edmund K. Burke;Barry McCollum;Amnon Meisels;Sanja Petrovic

Frequent Co-Authors

Edmund K. Burke
Edmund K. Burke Bangor University
Graham Kendall
Graham Kendall MILA University
Sanja Petrovic
Sanja Petrovic University of Nottingham
Uwe Aickelin
Uwe Aickelin University of Melbourne
Salwani Abdullah
Salwani Abdullah National University of Malaysia
Peter Brucker
Peter Brucker Osnabrück University
Licheng Jiao
Licheng Jiao Xidian University
Tianrui Li
Tianrui Li Southwest Jiaotong University
Hisao Ishibuchi
Hisao Ishibuchi Southern University of Science and Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you’re interested in Computer Science, there are a variety of online degree programs that can help you advance your career or explore related fields. Many students look for the cheapest online masters option to gain specialized skills without breaking the bank. These programs offer flexibility for working professionals and can often be completed at your own pace.

Beyond a master’s, some career paths may require leadership skills in addition to technical expertise. For those who aspire to executive roles, consider pursuing an organizational leadership PhD or one of several online educational leadership programs. These advanced degrees combine research, strategy, and management training, paving the way to high-level positions in tech companies, academia, or government.

If you’re just starting your higher education journey, you might wonder what's the easiest associate's degree to get. Associate degrees in computer science provide a solid technical foundation and can quickly launch your career or prepare you for further study. With so many flexible online options available, now is a great time to explore the degree that best fits your goals.

Best Scientists Citing Rong Qu

Trending Scientists