KQKangjia Qiao

Kangjia Qiao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Kangjia Qiao has a total of 51 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Large-Scale Constrained Multi-Objective Evolutionary Algorithm with Promising Region Detection and Diversity Enhancement

    by Xiaoyu Zhong, Xiangjuan Yao, Kangjia Qiao, Dunwei Gong, Yaochu Jin

    Most existing constrained multi-objective evolutionary algorithms (CMOEAs) suffer from slow convergence and may even fail to find feasible solutions when dealing with problems that involve large-scale decision spaces and complex constraints. To this end, this paper introduces a promising region-guided CMOEA. In the proposed algorithm, a promising region detection and diversity enhancement strategy is designed to avoid entrapment in local optima. Specifically, this strategy first utilizes well-converged feasible non-dominated solutions among all solutions examined so far to detect the promising region where the constrained Pareto front may exist. Then, three non-dominated sorting procedures based on extended Pareto dominance, extended reverse Pareto dominance, and classical Pareto dominance, are sequentially executed to guide the population to evenly search the promising region and approach the constrained Pareto front from diverse search directions. In addition, an accelerated evolutionary search strategy is devised to improve reproduction quality in large-scale search spaces. Comprehensive experiments conducted on four benchmark test suites and thirty coal mine integrated energy system dispatch problems demonstrate the superiority of the proposed algorithm over seven state-of-the-art algorithms.


  • An adaptive multi-objective task splitting algorithm for agricultural multi-robot task allocation

    by Peng Chen, Jing Liang, Kang-Jia Qiao, Hui Song, Cai-Tong Yue, Tian-Lei Ma, Kun-Jie Yu, Ponnuthurai Nagaratnam Suganthan, Witold Pedrycz

    In smart farming, the development of multi-robot systems is essential for improving harvesting efficiency and addressing labor shortages, yet achieving optimal coordination presents significant scheduling complexities. This paper investigates a critical multi-robot task allocation problem in the context of orchard harvesting, focusing on multi-objective optimization (makespan and energy consumption) while considering task divisibility, robot re-utilization for multiple routes, and load-dependent energy consumption. Balancing these conflicting objectives across transport and operations, while managing the immensely expanded decision space due to task splitting, poses severe challenges to algorithm efficiency. To deal with these issues, we propose an adaptive multi-objective task splitting algorithm (AMTSA), which employs a hybrid encoding method to clearly demonstrate robot-route assignments and task-splitting information. Regarding the search modes, AMTSA adopts an adaptive strategy: the early phase emphasizes diverse exploration through route structural optimization, while the later phase shifts computational resources towards in-depth task splitting optimization (TSO) to accelerate convergence. Furthermore, the TSO process integrates two coordinated splitting mechanisms to collaboratively optimize the spatial layout and temporal balance of the task allocation by targeting the bottleneck robot, thereby addressing multi-objective conflicts. The effectiveness and robustness of AMTSA have been validated through comparative experiments on one real-world case study and 15 newly constructed test instances. Generally, this research advances the theoretical comprehension of multi-robot coordination and provides practical insights relevant to agricultural automation.


  • A Level-Based Multi-Population Self-Adaptive Constrained Multiobjective Evolutionary Algorithm for Cascade Reservoir Scheduling

    by Kangjia Qiao, Gang Liu, Jing Liang, Yuanjian Wang, Lei Li, Kunjie Yu, Caitong Yue

    Cascade reservoir scheduling (CRS) plays an important role in regulating watershed water resources and their environmental/economic benefits, and has therefore received increasing research in recent years. However, CRS, characterized by multi-objective, multi-constraint, and conflicting relationships between objectives and constraints, poses significant challenges to solving methods. This paper focuses on tri-objective CRS problems and designs a level-based multi-population self-adaptive constrained multiobjective evolutionary algorithm, which contains three main strategies. Firstly, a three-level population framework is proposed, where the top-level population optimizes the original problem, while middle-level and bottom-level populations respectively address constrained bi-objective and single-objective subproblems extracted from the original problem. This framework enables lower-level populations to achieve more efficient searches through objective reduction and provide effective information for higher-level populations. Secondly, a bi-direction information sharing-based environmental selection method is proposed to enable adjacent levels to exchange information during the environmental selection process, so as to ensure the effectiveness and low consumption of information exchange. Thirdly, a population self-adaptive activation method is proposed, where the relation between each single objective and constraints is analyzed to determine the effectiveness of bottom-level populations, and only high-effective bottom-level populations are activated to avoid resource waste. In experiments, the proposed algorithm is used to solve nine real-world CRS problems from Yellow River and real-world applications from other fields. Compared to latest constrained multiobjective evolutionary algorithms and practical scheduling rules, the proposed algorithm shows better or competitive performance regarding diversity and convergence.


  • Top Cited Papers

    A Time-Division-Based Constrained Multiobjective Optimization Method for Coal Mine Integrated Energy System Dispatch Problem

    by Kangjia Qiao, Jing Liang, Dunwei Gong, Yong Zhang, Canyun Dai, Jun Ma, Xuanxuan Ban, Kunjie Yu

    The coal mine integrated energy system dispatch problem (CMIES-DP) is a constrained multiobjective optimization problem (CMOP) with the characteristics of multiple objectives, high-dimensional decision variables, and multiple constraints, which makes it challenging for existing methods. On the one hand, existing constrained multiobjective evolutionary algorithms (CMOEAs) are prone to falling into local optima when facing problems with high-dimensional variables. On the other hand, the relationship between objectives and constraints of CMIES-DP has not been fully analyzed to guide the design of targeted solving techniques. Therefore, this article proposes a time-division-based CMOEA (TDCEA), where the characteristics of CMIES-DP are analyzed to design two main strategies. First, by analyzing the temporal relationship of objectives and constraints, CMIES-DP is decomposed into multiple subproblems with fewer variables and constraints, and these subproblems are sequentially solved to obtain better decision variables. Then, a random concatenation method is designed to combine the decision variables output from subproblems into a solution set with complete decision variables, and the new solution set will be further optimized to find feasible Pareto optimal solutions. Second, the relationship between constraints and objectives is analyzed to guide the design of evolving populations, so as to improve the search ability of the algorithm. In the experiments, the proposed algorithm is used to solve a real-world CMIES-DP case, and results demonstrate that compared with other advanced algorithms, the proposed algorithm achieves better performance regarding diversity, convergence, and distribution.


  • Multiobjective Task Allocation for Electric Harvesting Robots: A Hierarchical Route Reconstruction Approach

    by Peng Chen, Jing Liang, Hui Song, Kang-Jia Qiao, Cai-Tong Yue, Kun-Jie Yu, Ponnuthurai Nagaratnam Suganthan, Witold Pedrycz

    The increasing labor costs in agriculture have accelerated the adoption of multirobot systems for orchard harvesting. However, efficiently coordinating these systems is challenging due to the complex interplay between makespan and energy consumption, particularly under practical constraints like load-dependent speed variations and battery limitations. This article defines the multiobjective agricultural multielectrical-robot task allocation (AMERTA) problem, which systematically incorporates these often-overlooked real-world constraints. To address this problem, we propose a hybrid hierarchical route reconstruction algorithm (HRRA) that integrates several innovative mechanisms, including a hierarchical encoding structure, a dual-phase initialization method, task-sequence optimizers, and specialized route reconstruction operators. Extensive experiments on 45 test instances demonstrate HRRA’s superior performance against seven state-of-the-art algorithms. Statistical analysis, including the Wilcoxon signed-rank and Friedman tests, empirically validates HRRA’s competitiveness and its unique ability to explore previously inaccessible regions of the solution space. In general, this research contributes to the theoretical understanding of multirobot coordination by offering a novel problem formulation and an effective algorithm, thereby also providing practical insights for agricultural automation.


  • Open Access

    Multi-objective task allocation for electric harvesting robots: a hierarchical route reconstruction approach

    by Peng Chen, Jing Liang, Hui Song, Kang-Jia Qiao, Cai-Tong Yue, Kun-Jie Yu, Ponnuthurai Nagaratnam Suganthan, Witold Pedrycz

    The increasing labor costs in agriculture have accelerated the adoption of multi-robot systems for orchard harvesting. However, efficiently coordinating these systems is challenging due to the complex interplay between makespan and energy consumption, particularly under practical constraints like load-dependent speed variations and battery limitations. This paper defines the multi-objective agricultural multi-electrical-robot task allocation (AMERTA) problem, which systematically incorporates these often-overlooked real-world constraints. To address this problem, we propose a hybrid hierarchical route reconstruction algorithm (HRRA) that integrates several innovative mechanisms, including a hierarchical encoding structure, a dual-phase initialization method, task sequence optimizers, and specialized route reconstruction operators. Extensive experiments on 45 test instances demonstrate HRRA's superior performance against seven state-of-the-art algorithms. Statistical analysis, including the Wilcoxon signed-rank and Friedman tests, empirically validates HRRA's competitiveness and its unique ability to explore previously inaccessible regions of the solution space. In general, this research contributes to the theoretical understanding of multi-robot coordination by offering a novel problem formulation and an effective algorithm, thereby also providing practical insights for agricultural automation.

  • A Similar-Niching-Based Differential Evolution for Constrained Multimodal Multiobjective Optimization

    by Hongyu Lin, Jing Liang, Caitong Yue, Ying Bi, Kangjia Qiao, Yaonan Wang, Ponnuthurai Nagaratnam Suganthan

    In constrained multimodal multiobjective optimization problems (CMMOPs), the existence of discrete and confined feasible regions bring great challenges to current multiobjective optimization evolutionary algorithms (MOEAs). To address these challenges, this article proposes a constrained multimodal multiobjective differential evolution algorithm, which incorporates a similar-niching-based reproduction operator and a novel environmental selection mechanism. The proposed algorithm initiates by segregating the population into distinct niches, thereby promoting independent evolution within each niche. This segmentation enhances the exploration of multiple discrete feasible regions, thus improving the capacity to find diverse Pareto optimal solutions. Moreover, the algorithm selects the most similar niche to collaboratively generate solutions, further enhancing its ability to generate effective feasible solutions. To improve the diversity within the population, the proposed environmental selection mechanism gives preference to solutions that enhance the distribution of the next-generation population. By considering the diversity in both two spaces, the population retains more pareto optimal solutions. Based on the Friedman test results of the comparison experiment with other representative algorithms and the champion algorithm of the CEC2023 CMMOPs competition, the proposed algorithm attained the top ranking, thereby reinforcing its demonstrated superiority. Meanwhile, the proposed algorithm is used to solve the constrained multimodal multiobjective location selection problem and results show its superiority.


  • Dynamic Constrained Multiobjective Evolutionary Algorithm With Multipopulation Prediction and Dynamic Fusion Ranking

    by Dezheng Zhang, Kai Zhang, Kunjie Yu, Jing Liang, Kangjia Qiao, Boyang Qu, Ke Chen, Caitong Yue

    Dynamic constrained multiobjective optimization problems (DCMOPs) are widely existed in real-world applications and emerged as a prominent research focus in the evolutionary computation community. Current studies on DCMOPs face two main challenges: limited accuracy in population prediction, and a lack of effective strategies to improve static optimizer performance. To tackle these challenges, this paper proposes a dynamic constrained multiobjective evolutionary algorithm based on multipopulation prediction and dynamic fusion ranking. Specifically, an efficient computer-vision-inspired point set registration method, named coherent point drift, is introduced to align individuals across successive environments. With the correspondences between two environments, the solution trajectory tracking problem is transformed as a point set registration problem. Based on the observed trajectory of solutions, the Pareto-optimal set or Pareto-optimal front in the new environment can be predicted. Additionally, this paper highlights the importance of task-specific multipopulation prediction. After analysis the specific tasks of each population, different initial populations tailored to the tasks are predicted by the proposed prediction method. Finally, a dynamic fusion based two-ranking environmental selection strategy is proposed for the auxiliary task. This strategy dynamically integrates experience-based and constraint-based approaches, improving the auxiliary population evolutionary efficiency and its alignment with the main task. The superiority of proposed algorithm is validated through extensive experiments on a series of benchmark problems and a real-world raw ore allocation problem.


  • A Reinforced Neighborhood Search Method Combined With Genetic Algorithm for Multi-Objective Multi-Robot Transportation System

    by Peng Chen, Jing Liang, Kang-Jia Qiao, Hui Song, Ponnuthurai Nagaratnam Suganthan, Lou-Lei Dai, Xuan-Xuan Ban

    With the rapid advancement of artificial intelligence, autonomous multi-robot systems have been successfully applied to various domains. Therefore, developing intelligent routing and scheduling systems to efficiently coordinate multi-robot movements in transportation networks emerges as a critical challenge. To address this issue, this study constructs an optimization model for cooperative robot operations, aiming to minimize total energy consumption and the completion time of most time-consuming robot. These objectives contain conflicts, thus requiring a multi-objective optimization approach to resolve them. We propose a reinforced neighborhood search method combined with genetic algorithm (RNSGA), which combines single solution search ideas and population-based techniques. RNSGA consists of two crucial steps: route construction to determine the composition and visiting sequence of task points within each route, as well as route allocation to assign routes to individual robots. The route construction phase incorporates several key components, including solution initialization, route balance mechanism, proximity-based optimization mechanism, and intro-route sequence adjustment method. For the route allocation phase, a population-based allocation mechanism is employed to determine the optimal assignment of routes. Comprehensive experiments on 24 classic transportation test instances demonstrate that RNSGA significantly outperforms six state-of-the-art algorithms.