Qinghua Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Qinghua Wu has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- Jin-Kao Hao
Department of Computer Science, LERIA Laboratory, University of Angers, Angers, France
19 shared publications Yongliang Lu
6 shared publicationsUna Benlic
5 shared publicationsMingjie Li
4 shared publicationsWenlong Li
Southeast Univ, Sch Cyber Sci & Engn, 2 Rd Southeast Univ, Nanjing 211189, Peoples R China
3 shared publications- Xingcun Li
School of Management, Huazhong University of Science and Technology, Wuhan, China
3 shared publications
Latest Publications
- Open Access
- 18 September 2026
- Published by Elsevier in European Journal of Operational Research
Learning-driven multi-start local search for the multiple row equal facility layout problem
- 18 September 2026
- Published by Elsevier in European Journal of Operational Research
Open AccessLearning-driven multi-start local search for the multiple row equal facility layout problem
- 1 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (3) , 829-843
A Hybrid Genetic Algorithm with Multi-Population for Capacitated Location Routing
The capacitated location-routing problem involves determining the depots from a set of candidate-capacitated depot locations and finding the required routes for a fleet of vehicles starting from and ending at the selected depots to serve a set of customers such that the solution minimizes a cost function that includes the cost of opening the selected depots, the fixed utilization cost per vehicle used, and the total cost (distance) of the routes. This paper presents a hybrid genetic algorithm with multi-population, which includes an effective multi-depot edge assembly crossover to generate promising offspring from the perspective of both depot location and route edge assembly, a neighborhood-based local search to optimize the routes of each offspring solution, and a diversification-oriented mutation. Of particular interest is the multi-population scheme that organizes the population into multiple subpopulations according to the depot configurations being explored. Extensive experiments on four sets of 281 benchmark instances from the literature show that the algorithm performs remarkably well. Additional experiments are presented to gain insight into the role of the key elements of the algorithm. History: Accepted by Russel Bent, Area Editor for Network Optimization: Algorithms & Applications. Funding: This work was supported by the National Natural Science Foundation of China [Grants 62403123, 72471100, and 72122006]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0416 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0416 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 38 (3) , 829-843
A Hybrid Genetic Algorithm with Multi-Population for Capacitated Location Routing
The capacitated location-routing problem involves determining the depots from a set of candidate-capacitated depot locations and finding the required routes for a fleet of vehicles starting from and ending at the selected depots to serve a set of customers such that the solution minimizes a cost function that includes the cost of opening the selected depots, the fixed utilization cost per vehicle used, and the total cost (distance) of the routes. This paper presents a hybrid genetic algorithm with multi-population, which includes an effective multi-depot edge assembly crossover to generate promising offspring from the perspective of both depot location and route edge assembly, a neighborhood-based local search to optimize the routes of each offspring solution, and a diversification-oriented mutation. Of particular interest is the multi-population scheme that organizes the population into multiple subpopulations according to the depot configurations being explored. Extensive experiments on four sets of 281 benchmark instances from the literature show that the algorithm performs remarkably well. Additional experiments are presented to gain insight into the role of the key elements of the algorithm. History: Accepted by Russel Bent, Area Editor for Network Optimization: Algorithms & Applications. Funding: This work was supported by the National Natural Science Foundation of China [Grants 62403123, 72471100, and 72122006]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0416 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0416 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 14 January 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 189
Frequent pattern mining driven evolutionary search for cross-dock door assignment
- 14 January 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 189
Frequent pattern mining driven evolutionary search for cross-dock door assignment
- 8 January 2026
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 64 (7) , 2780-2804
Emission reduction decision under carbon quota competition versus cooperation trade mode of dual supply chain based on two allocation mechanisms
- 8 January 2026
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 64 (7) , 2780-2804
Emission reduction decision under carbon quota competition versus cooperation trade mode of dual supply chain based on two allocation mechanisms
- Open Access
- 1 January 2026
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2026 (1)
A CNN‐LSTM‐Based Multivariate Time Series Model for Aircraft Trajectory Prediction
Aircraft trajectory prediction is a critical enabler for modern air traffic management, offering accurate estimations of future aircraft positions to enhance safety, efficiency, and predictability and supporting intelligent airspace operations. In this study, we propose a hybrid deep learning model that integrates convolutional neural networks (CNNs) and long short‐term memory (LSTM) networks to jointly capture spatial patterns and temporal dependencies from multivariate flight data. The CNN module extracts local spatial features from each historical time step, while the LSTM module models sequential dynamics to forecast the next 3D position in latitude, longitude, and altitude. Evaluated on the real‐world UST air traffic dataset comprising over 6000 inbound flights to Hong Kong International Airport, our method consistently outperforms competitive baselines across multiple error metrics and visualizations. The model achieves high prediction accuracy while maintaining a compact architecture suitable for real‐time applications, demonstrating the effectiveness of combining convolutional and recurrent structures for trajectory forecasting in structured airspace environments.
- 1 January 2026
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2026 (1)
Open AccessA CNN‐LSTM‐Based Multivariate Time Series Model for Aircraft Trajectory Prediction
Aircraft trajectory prediction is a critical enabler for modern air traffic management, offering accurate estimations of future aircraft positions to enhance safety, efficiency, and predictability and supporting intelligent airspace operations. In this study, we propose a hybrid deep learning model that integrates convolutional neural networks (CNNs) and long short‐term memory (LSTM) networks to jointly capture spatial patterns and temporal dependencies from multivariate flight data. The CNN module extracts local spatial features from each historical time step, while the LSTM module models sequential dynamics to forecast the next 3D position in latitude, longitude, and altitude. Evaluated on the real‐world UST air traffic dataset comprising over 6000 inbound flights to Hong Kong International Airport, our method consistently outperforms competitive baselines across multiple error metrics and visualizations. The model achieves high prediction accuracy while maintaining a compact architecture suitable for real‐time applications, demonstrating the effectiveness of combining convolutional and recurrent structures for trajectory forecasting in structured airspace environments.
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (6) , 1560-1586
Layout Optimization for a Large-Scale Grid-Connected Solar Power Plant
A solar power plant provides green electricity to the public via a power grid. As governments worldwide have pledged to reduce carbon emissions and achieve carbon neutrality, large-scale grid-connected solar power plants are booming. Developing such a plant requires significant investment, a large proportion of which covers construction costs. Such costs, together with the energy yield, critically depend on the plant’s layout. The layout planning of a solar power plant involves a series of complex optimization problems such as district partitioning, photovoltaic (PV) component location, and cable routing problems in a solar power plant. These problems have received limited attention in the literature and are highly challenging because they involve large-scale instances, complex design principles, and complicated physical constraints. Motivated by our collaborative projects with an electrical engineering company in China, this paper specifically focuses on the integrated location and routing (ILR) problem, which involves locating service ways, inverters, combiner boxes, and routing cables to connect them. We develop exact algorithms to effectively solve the ILR problem via a decomposition framework (leading to a variant of Benders decomposition (BD)), which is proven to produce an optimal solution. We also develop an exact branch-and-cut scheme to solve each subproblem in the decomposition framework by incorporating cutting planes and separation algorithms. Our solution approach is evaluated on 50 real-world data instances via extensive numerical experiments. Compared with the manual method based on greedy heuristics used in practice, our approach reduces the total cost by approximately 20%. Our decomposition method also achieves an average gap of 0.02% between the obtained lower and upper bounds, significantly smaller than the 16.08% gap achieved with the traditional BD. History: Accepted by David Alderson, Area Editor for Network Optimization: Algorithms & Applications. Funding: This work was partially supported by the Research Grants Council of Hong Kong [Grant 15501221], the National Natural Science Foundation Program of China [Grants 72122006, 72471100, and 72131008], Huazhong University of Science and Technology Double First-Class Funds for Humanities and Social Sciences (Digital Intelligence Decision Optimization Innovation Team), the Interdisciplinary Research Program of HUST [Grant 5003300129], and the Fundamental Research Funds for the Central Universities [Grant 2023WKFZZX101]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0223 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0223 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (6) , 1560-1586
Layout Optimization for a Large-Scale Grid-Connected Solar Power Plant
A solar power plant provides green electricity to the public via a power grid. As governments worldwide have pledged to reduce carbon emissions and achieve carbon neutrality, large-scale grid-connected solar power plants are booming. Developing such a plant requires significant investment, a large proportion of which covers construction costs. Such costs, together with the energy yield, critically depend on the plant’s layout. The layout planning of a solar power plant involves a series of complex optimization problems such as district partitioning, photovoltaic (PV) component location, and cable routing problems in a solar power plant. These problems have received limited attention in the literature and are highly challenging because they involve large-scale instances, complex design principles, and complicated physical constraints. Motivated by our collaborative projects with an electrical engineering company in China, this paper specifically focuses on the integrated location and routing (ILR) problem, which involves locating service ways, inverters, combiner boxes, and routing cables to connect them. We develop exact algorithms to effectively solve the ILR problem via a decomposition framework (leading to a variant of Benders decomposition (BD)), which is proven to produce an optimal solution. We also develop an exact branch-and-cut scheme to solve each subproblem in the decomposition framework by incorporating cutting planes and separation algorithms. Our solution approach is evaluated on 50 real-world data instances via extensive numerical experiments. Compared with the manual method based on greedy heuristics used in practice, our approach reduces the total cost by approximately 20%. Our decomposition method also achieves an average gap of 0.02% between the obtained lower and upper bounds, significantly smaller than the 16.08% gap achieved with the traditional BD. History: Accepted by David Alderson, Area Editor for Network Optimization: Algorithms & Applications. Funding: This work was partially supported by the Research Grants Council of Hong Kong [Grant 15501221], the National Natural Science Foundation Program of China [Grants 72122006, 72471100, and 72131008], Huazhong University of Science and Technology Double First-Class Funds for Humanities and Social Sciences (Digital Intelligence Decision Optimization Innovation Team), the Interdisciplinary Research Program of HUST [Grant 5003300129], and the Fundamental Research Funds for the Central Universities [Grant 2023WKFZZX101]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0223 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0223 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 August 2025
- Published by Taylor & Francis in IISE Transactions
- Vol. 58 (6) , 722-737
Combining hash-based Tabu search and frequent pattern mining for job-shop scheduling
- 1 August 2025
- Published by Taylor & Francis in IISE Transactions
- Vol. 58 (6) , 722-737
Combining hash-based Tabu search and frequent pattern mining for job-shop scheduling
- 1 July 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (4) , 1018-1043
An Efficient Optimization Model and Tabu Search–Based Global Optimization Approach for the Continuous p-Dispersion Problem
Continuous p-dispersion problems with and without boundary constraints are NP-hard optimization problems with numerous real-world applications, notably in facility location and circle packing, which are widely studied in mathematics and operations research. In this work, we concentrate on general cases with a nonconvex multiply connected region that are rarely studied in the literature due to their intractability and the absence of an efficient optimization model. Using the penalty function approach, we design a unified and almost everywhere differentiable optimization model for these complex problems and propose a tabu search–based global optimization (TSGO) algorithm for solving them. Computational results over a variety of benchmark instances show that the proposed model works very well, allowing popular local optimization methods (e.g., the quasi-Newton methods and the conjugate gradient methods) to reach high-precision solutions due to the differentiability of the model. These results further demonstrate that the proposed TSGO algorithm is very efficient and significantly outperforms several popular global optimization algorithms in the literature, improving the best-known solutions for several existing instances in a short computational time. Experimental analyses are conducted to show the influence of several key ingredients of the algorithm on computational performance. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72122006, 71821001, and 72471100] Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0089 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0089 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 July 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (4) , 1018-1043
An Efficient Optimization Model and Tabu Search–Based Global Optimization Approach for the Continuous p-Dispersion Problem
Continuous p-dispersion problems with and without boundary constraints are NP-hard optimization problems with numerous real-world applications, notably in facility location and circle packing, which are widely studied in mathematics and operations research. In this work, we concentrate on general cases with a nonconvex multiply connected region that are rarely studied in the literature due to their intractability and the absence of an efficient optimization model. Using the penalty function approach, we design a unified and almost everywhere differentiable optimization model for these complex problems and propose a tabu search–based global optimization (TSGO) algorithm for solving them. Computational results over a variety of benchmark instances show that the proposed model works very well, allowing popular local optimization methods (e.g., the quasi-Newton methods and the conjugate gradient methods) to reach high-precision solutions due to the differentiability of the model. These results further demonstrate that the proposed TSGO algorithm is very efficient and significantly outperforms several popular global optimization algorithms in the literature, improving the best-known solutions for several existing instances in a short computational time. Experimental analyses are conducted to show the influence of several key ingredients of the algorithm on computational performance. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72122006, 71821001, and 72471100] Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0089 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0089 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 20 June 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for A Hybrid Genetic Algorithm with Multi-population for Capacitated Location Routing
The software and data in this repository are a snapshot of the software and data that were used in the research reported in the paper A Hybrid Genetic Algorithm with Multi-population for Capacitated Location Routing by P.F. He, J.K. Hao, and Q.H. Wu.
- 20 June 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for A Hybrid Genetic Algorithm with Multi-population for Capacitated Location Routing
The software and data in this repository are a snapshot of the software and data that were used in the research reported in the paper A Hybrid Genetic Algorithm with Multi-population for Capacitated Location Routing by P.F. He, J.K. Hao, and Q.H. Wu.