Hassan Jalil

Hassan Jalil

Auto-generated profile, based on publicly available information

Hassan Jalil

College of Mathematics and Informatics, South China Agricultural University, Guangzhou, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 December 2022 in Computers and Electronics in Agriculture
Verified
Journal Article
Closed access
KLKangshun Li
Kangshun Li
JWJiancong Wang
Jiancong Wang
HJHassan Jalil
Hassan Jalil
HWHui Wang
Hui Wang

21 December 2023 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
SXShumin Xie
Shumin Xie
KLKangshun Li
Kangshun Li
WWWenxiang Wang
Wenxiang Wang
HWHui Wang
Hui Wang
CPChaoda Peng
Chaoda Peng
HJHassan Jalil
Hassan Jalil
Both dual-population and two-phase strategies are effective for utilizing infeasible solution information and significantly enhancing the ability of algorithms to solve constrained multi-objective optimization problems. However, most existing algorithms tend to underperform when facing problems with complex constraints. To address these issues, a constrained multi-objective evolutionary algorithm named DPTPEA, which combines dual-population and two-phase strategies, is proposed in this paper. DPTPEA employs two collaborative populations (the exploitive population and the tractive population) and divides the evolutionary process of the tractive population into two phases (Phase 1 and Phase 2). In Phase 1, the tractive population ignores constraints and drags the exploitive population across the infeasible region by sharing offspring information. In Phase 2, the tractive population adopts the epsilon-constrained method to converge toward the constrained Pareto front and to guide the exploitive population exploiting different feasible regions. Moreover, a dynamic cooperation strategy, a boundary point direction sampling strategy, and a dynamic environmental selection are proposed to improve the exploration ability of tractive population for solving complex problems. Comprehensive experiments on three popular test suites demonstrate that DPTPEA outperforms seven state-of-the-art algorithms on most test problems.

28 August 2022 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
WWWenxiang Wang
Wenxiang Wang
KLKangshun Li
Kangshun Li
HJHassan Jalil
Hassan Jalil
HWHui Wang
Hui Wang

25 January 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
HJHassan Jalil
Hassan Jalil
KLKangshun Li
Kangshun Li
WYWeiqin Ying
Weiqin Ying
Multiobjective evolutionary algorithms (EAs) based on decomposition are becoming successful and popular. Particularly, a conical area EA (CAEA) was developed to heighten the convergence and population diversity of decomposition-based algorithms for bi-objective optimization by employing a cone decomposition approach. The global Pareto optimality of cone decomposition was proved. It means that the optimum of every conical subproblem of the cone decomposition approach is Pareto optimal in the entire bi-objective space in the presence of a continuous frontier segment within its associated subregion. In this article, based on the global Pareto optimality, we further reveal that the cone decomposition approach also has a desired ability of $\mu $ -distribution convergence for bi-objective optimization. We first prove by the monotonicity and additivity of the Lebesgue measure and the squeeze theorem for limits that the hypervolume of the optimal solutions of all $\mu $ subproblems of the cone decomposition approach is infinitely close to that of the optimal $\mu $ -distribution for large enough $\mu $ in the presence of a continuous frontier. Meanwhile, the original CAEA is further improved to better approximate the optimal solutions of conical subproblems. The experimental results on bi-objective benchmark problems show that the improved CAEA achieves higher qualities of frontiers and better $\mu $ -distribution convergence in the terms of hypervolume error compared with six other popular multiobjective algorithms.

20 February 2019 in Processes
Verified
Journal Article
Open access
PDF file
WYWeiqin Ying
Weiqin Ying
HJHassan Jalil
Hassan Jalil
BWBingshen Wu
Bingshen Wu
YWYu Wu
Yu Wu
ZYZhenyu Ying
Zhenyu Ying
ZWZhenyu Wang
Zhenyu Wang
Detecting community structures helps to reveal the functional units of complex networks. In this paper, the community detection problem is regarded as a modularity-based multi-objective optimization problem (MOP), and a parallel conical area community detection algorithm (PCACD) is designed to solve this MOP effectively and efficiently. In consideration of the global properties of the selection and update mechanisms, PCACD employs a global island model and targeted elitist migration policy in a conical area evolutionary algorithm (CAEA) to discover community structures at different resolutions in parallel. Although each island is assigned only a portion of all sub-problems in the island model, it preserves a complete population to accomplish the global selection and update. Meanwhile the migration policy directly migrates each elitist individual to an appropriate island in charge of the sub-problem associated with this individual to share essential evolutionary achievements. In addition, a modularity-based greedy local search strategy is also applied to accelerate the convergence rate. Comparative experimental results on six real-world networks reveal that PCACD is capable of discovering potential high-quality community structures at diverse resolutions with satisfactory running efficiencies.