About
12
Publications
1,443
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
109
Citations
Publications
Publications (12)
The problem of reconstructing nonlinear and complex dynamical systems from available data or time series is prominent in many fields including engineering, physical, computer, biological, and social sciences. Many methods have been proposed to address this problem and their performance is satisfactory. However, none of them can reconstruct network...
The problem of inferring nonlinear and complex dynamical systems from available data is prominent in many fields including engineering, biological, social, physical, and computer sciences. Many evolutionary algorithm (EA) based network reconstruction methods have been proposed to address this problem, but they ignore several useful information of n...
Research concerning cascading failures in complex networks has become a hot topic. However, most of the existing studies have focused on modelling the cascading phenomenon on networks and analysing network robustness from a theoretical point of view, which considers only the damage incurred by the failure of one or several nodes. However, such a th...
This paper presents a region-based technique for fusion of a multifocus color image sequence in the LUV color space. First, mean shift segmentation was applied on the weighted average image of the image sequence to obtain the fusion reference areas. Second, for each segmented area, the well-known modified Laplacian (LAP2) was used as a focus measur...
The evolutionary algorithms (EAs) became more and more important in solving NP-hard problems in recent years. The representation of specific problems in EAs is very important and it has a great influence on the performance of EAs. The constraint satisfaction problems (CSPs) are typical NP-hard problems and the representation of CSPs can be traditio...
Questions
Questions (2)
Lots of evolutionary algorithms suck as MOEA/D, NSGA-II/III, and IBEA, etc, have been propsoed until now. If I want to use one of them to solve the combinational optimization problems, which contains 5 conflict objectives, which evolutionary multi/many-objective algorithm is the most suitable/effective that I should use, in terms of the implementation and the performance. I really appreciate it if someone can share some suggestions for me.
Recently I read several papers about using hyper-heuristics in solving educational timetabling problems, such as Burke E K, Mccollum B, Meisels A, et al. A graph-based hyper-heuristic for educational timetabling problems[J]. European Journal of Operational Research, 2007, 176(1):177-192. and for more this kind of papers one can refer to http://www.cs.nott.ac.uk/~pszrq/publications.htm, which is Prof Rong Qu's homepage.
Through these papers I found that the hyper-heuristics archieve good results, but most of them gave few details about the hyper-heuristics. Thus, I am not really understand how the hyper-heuritics work.
Does anyone knows if there is any souce code about the hyper-heuristics, not limit on the above mentioned papers, to help me understand how hyper-heuristic works.
Many thanks for any help.
