Skip to main content

Research Repository

Advanced Search

Professor RONG QU's Outputs (100)

An Efficient Federated Distillation Learning System for Multitask Time Series Classification (2022)
Journal Article
Xing, H., Xiao, Z., Qu, R., Zhu, Z., & Zhao, B. (2022). An Efficient Federated Distillation Learning System for Multitask Time Series Classification. IEEE Transactions on Instrumentation and Measurement, 71, https://doi.org/10.1109/TIM.2022.3201203

This paper proposes an efficient federated distillation learning system (EFDLS) for multi-task time series classification (TSC). EFDLS consists of a central server and multiple mobile users, where different users may run different TSC tasks. EFDLS ha... Read More about An Efficient Federated Distillation Learning System for Multitask Time Series Classification.

Automated Design of Metaheuristics Using Reinforcement Learning within a Novel General Search Framework (2022)
Journal Article
Yi, W., Qu, R., Jiao, L., & Niu, B. (2023). Automated Design of Metaheuristics Using Reinforcement Learning within a Novel General Search Framework. IEEE Transactions on Evolutionary Computation, 27(4), 1072-1084. https://doi.org/10.1109/TEVC.2022.3197298

Metaheuristic algorithms have been investigated intensively to address highly complex combinatorial optimisation problems. However, most metaheuristic algorithms have been designed manually by researchers of different expertise without a consistent f... Read More about Automated Design of Metaheuristics Using Reinforcement Learning within a Novel General Search Framework.

An Improved Ant Colony Approach for the Competitive Traveling Salesmen Problem (2022)
Presentation / Conference Contribution
Du, X., Bai, R., Cui, T., Qu, R., & Li, J. (2022, July). An Improved Ant Colony Approach for the Competitive Traveling Salesmen Problem. Presented at 2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Conference Proceedings, Padua, Italy

A competitive traveling salesmen problem is a variant of traveling salesman problem in that multiple agents compete with each other in visiting a number of cities. The agent who is the first one to visit a city will receive a reward. Each agent aims... Read More about An Improved Ant Colony Approach for the Competitive Traveling Salesmen Problem.

A Collaborative Learning Tracking Network for Remote Sensing Videos (2022)
Journal Article
Li, X., Jiao, L., Zhu, H., Liu, F., Yang, S., Zhang, X., Wang, S., & Qu, R. (2023). A Collaborative Learning Tracking Network for Remote Sensing Videos. IEEE Transactions on Cybernetics, 53(3), 1954-1967. https://doi.org/10.1109/TCYB.2022.3182993

With the increasing accessibility of remote sensing videos, remote sensing tracking is gradually becoming a hot issue. However, accurately detecting and tracking in complex remote sensing scenes is still a challenge. In this article, we propose a col... Read More about A Collaborative Learning Tracking Network for Remote Sensing Videos.

Identify Patterns in Online Bin Packing Problem: An Adaptive Pattern-Based Algorithm (2022)
Journal Article
Lin, B., Li, J., Bai, R., Qu, R., Cui, T., & Jin, H. (2022). Identify Patterns in Online Bin Packing Problem: An Adaptive Pattern-Based Algorithm. Symmetry, 14(7), Article 1301. https://doi.org/10.3390/sym14071301

Bin packing is a typical optimization problem with many real-world application scenarios. In the online bin packing problem, a sequence of items is revealed one at a time, and each item must be packed into a bin immediately after its arrival. Inspire... Read More about Identify Patterns in Online Bin Packing Problem: An Adaptive Pattern-Based Algorithm.

Automated design of search algorithms: Learning on algorithmic components (2021)
Journal Article
Meng, W., & Qu, R. (2021). Automated design of search algorithms: Learning on algorithmic components. Expert Systems with Applications, 185, Article 115493. https://doi.org/10.1016/j.eswa.2021.115493

This paper proposes AutoGCOP, a new general framework for automated design of local search algorithms. In a recently established General Combinatorial Optimisation Problem (GCOP) model, the problem of algorithm design itself is defined as a combinato... Read More about Automated design of search algorithms: Learning on algorithmic components.

A Hybrid Pricing and Cutting Approach for the Multi-Shift Full Truckload Vehicle Routing Problem (2020)
Journal Article
Xue, N., Bai, R., Qu, R., & Aickelin, U. (2021). A Hybrid Pricing and Cutting Approach for the Multi-Shift Full Truckload Vehicle Routing Problem. European Journal of Operational Research, 292(2), 500-514. https://doi.org/10.1016/j.ejor.2020.10.037

Full truckload transportation (FTL) in the form of freight containers represents one of the most important transportation modes in international trade. Due to large volume and scale, in FTL, delivery time is often less critical but cost and service q... Read More about A Hybrid Pricing and Cutting Approach for the Multi-Shift Full Truckload Vehicle Routing Problem.

Towards a Severity Assessment Method for Potential Cyber Attacks to Connected and Autonomous Vehicles (2020)
Journal Article
He, Q., Meng, X., & Qu, R. (2020). Towards a Severity Assessment Method for Potential Cyber Attacks to Connected and Autonomous Vehicles. Journal of Advanced Transportation, 2020, 1-15. https://doi.org/10.1155/2020/6873273

CAV (connected and autonomous vehicle) is a crucial part of intelligent transportation systems. CAVs utilize both sensors and communication components to make driving decisions. A large number of companies, research organizations, and governments hav... Read More about Towards a Severity Assessment Method for Potential Cyber Attacks to Connected and Autonomous Vehicles.

Assessing hyper-heuristic performance (2020)
Journal Article
Pillay, N., & Qu, R. (2021). Assessing hyper-heuristic performance. Journal of the Operational Research Society, 72(11), 2503-2516. https://doi.org/10.1080/01605682.2020.1796538

Limited attention has been paid to assessing the generality performance of hyper-heuristics. The performance of hyper-heuristics has been predominately assessed in terms of optimality which is not ideal as the aim of hyper-heuristics is not to be com... Read More about Assessing hyper-heuristic performance.

Machine Learning-Based Detection for Cyber Security Attacks on Connected and Autonomous Vehicles (2020)
Journal Article
He, Q., Meng, X., Qu, R., & Xi, R. (2020). Machine Learning-Based Detection for Cyber Security Attacks on Connected and Autonomous Vehicles. Mathematics, 8(8), Article 1311. https://doi.org/10.3390/math8081311

Connected and Autonomous Vehicle (CAV)-related initiatives have become some of the fastest expanding in recent years, and have started to affect the daily lives of people. More and more companies and research organizations have announced their initia... Read More about Machine Learning-Based Detection for Cyber Security Attacks on Connected and Autonomous Vehicles.

A Unified Framework of Graph-based Evolutionary Multitasking Hyper-heuristic (2020)
Journal Article
Hao, X., Qu, R., & Liu, J. (2021). A Unified Framework of Graph-based Evolutionary Multitasking Hyper-heuristic. IEEE Transactions on Evolutionary Computation, 25(1), 35-47. https://doi.org/10.1109/tevc.2020.2991717

In recent research, hyper-heuristics have attracted increasing attention among researchers in various fields. The most appealing feature of hyper-heuristics is that they aim to provide more generalized solutions to optimization problems by searching... Read More about A Unified Framework of Graph-based Evolutionary Multitasking Hyper-heuristic.

A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices (2019)
Journal Article
Cui, T., Bai, R., Ding, S., Parkes, A. J., Qu, R., He, F., & Li, J. (2020). A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices. Soft Computing, 24, 2809–2831. https://doi.org/10.1007/s00500-019-04517-y

© 2019, Springer-Verlag GmbH Germany, part of Springer Nature. Portfolio optimization is one of the most important problems in the finance field. The traditional Markowitz mean-variance model is often unrealistic since it relies on the perfect market... Read More about A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices.

Information Retrieval for Evidence-Based Policy Making Applied to Lifelong Learning (2019)
Presentation / Conference Contribution
Clos, J., Qu, R., & Atkin, J. (2019, December). Information Retrieval for Evidence-Based Policy Making Applied to Lifelong Learning. Presented at International Conference on Innovative Techniques and Applications of Artificial Intelligence (SGAI 2019: Artificial Intelligence XXXVI), Cambridge, UK

© 2019, Springer Nature Switzerland AG. Policy making involves an extensive research phase during which existing policies which are similar to the one under development need to be retrieved and analysed. This phase is time-consuming for the following... Read More about Information Retrieval for Evidence-Based Policy Making Applied to Lifelong Learning.

Accelerated genetic algorithm based on search-space decomposition for change detection in remote sensing images (2019)
Journal Article
Mu, C.-H., Li, C.-Z., Liu, Y., Qu, R., & Jiao, L.-C. (2019). Accelerated genetic algorithm based on search-space decomposition for change detection in remote sensing images. Applied Soft Computing, 84, Article 105727. https://doi.org/10.1016/j.asoc.2019.105727

Detecting change areas among two or more remote sensing images is a key technique in remote sensing. It usually consists of generating and analyzing a difference image thus to produce a change map. Analyzing the difference image to obtain the change... Read More about Accelerated genetic algorithm based on search-space decomposition for change detection in remote sensing images.

Controlling understaffing with conditional Value-at-Risk constraint for an integrated nurse scheduling problem under patient demand uncertainty (2019)
Journal Article
He, F., Chaussalet, T., & Qu, R. (2019). Controlling understaffing with conditional Value-at-Risk constraint for an integrated nurse scheduling problem under patient demand uncertainty. Operations Research Perspectives, 6, Article 100119. https://doi.org/10.1016/j.orp.2019.100119

Nursing workforce management is a challenging decision-making task in hospitals. The decisions are made across different timescales and levels from strategic long-term staffing budget to mid-term scheduling. These decisions are interconnected and imp... Read More about Controlling understaffing with conditional Value-at-Risk constraint for an integrated nurse scheduling problem under patient demand uncertainty.

Multi-objective ant colony optimization algorithm based on decomposition for community detection in complex networks (2019)
Journal Article
Mu, C., Zhang, J., Liu, Y., Qu, R., & Huang, T. (2019). Multi-objective ant colony optimization algorithm based on decomposition for community detection in complex networks. Soft Computing, 23, 12683-12709. https://doi.org/10.1007/s00500-019-03820-y

Community detection aims to identify topological structures and discover patterns in complex networks, which presents an important problem of great significance. The problem can be modeled as an NP hard combinatorial optimization problem, to which mu... Read More about Multi-objective ant colony optimization algorithm based on decomposition for community detection in complex networks.

Modified mixed-dimension chaotic particle swarm optimization for liner route planning with empty container repositioning (2018)
Presentation / Conference Contribution
Yu, M., Chen, Z., Chen, L., Qu, R., & Niu, B. (2018, November). Modified mixed-dimension chaotic particle swarm optimization for liner route planning with empty container repositioning. Presented at The 13th International Conference on Bio-inspired Computing: Theories and Applications, Beijing, China

Empty container repositioning has become one of the important issues in ocean shipping industry. Researchers often solve these problems using linear programming or simulation. For large-scale problems, heuristic algorithms showed to be preferable due... Read More about Modified mixed-dimension chaotic particle swarm optimization for liner route planning with empty container repositioning.

Iteration-related various learning particle swarm optimization for quay crane scheduling problem (2018)
Presentation / Conference Contribution
Yu, M., Cong, X. C., Niu, B., & Qu, R. (2018, September). Iteration-related various learning particle swarm optimization for quay crane scheduling problem. Presented at The 13th International Conference on Bio-inspired Computing: Theories and Applications, Beijing, China

Quay crane scheduling is critical in reducing operation costs at container terminals. Designing a schedule to handling containers in an efficient order can be difficult. For this problem which is proved NP-hard, heuristic algorithms are effective to... Read More about Iteration-related various learning particle swarm optimization for quay crane scheduling problem.

A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows (2018)
Journal Article
Chen, B., Qu, R., Bai, R., & Laesanklang, W. (2018). A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows. Applied Intelligence, 48(12), 4937–4959. https://doi.org/10.1007/s10489-018-1250-y

In this paper, a Mixed-Shift Vehicle Routing Problem is proposed based on a real-life container transportation problem. In a long planning horizon of multiple shifts, transport tasks are completed satisfying the time constraints. Due to the different... Read More about A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows.