Skip to main navigation
Skip to search
Skip to main content
University of Birmingham Home
Help & FAQ
Home
Research output
Profiles
Research Units
Projects
Activities
Datasets
Equipment
Prizes
Press / Media
Search by expertise, name or affiliation
Evoloutionary Algorithms for Dynamic Optimisation Problems: Design, Analysis and Applications
Yao, Xin
(Principal Investigator)
Computer Science
Overview
Fingerprint
Research output
(19)
Project Details
Short title
Evoloutionary Algorithms for Dynamic Optimisation Problems: Design, Analysis and Applications
Status
Finished
Effective start/end date
1/12/07
→
31/05/11
Funding
ENGINEERING & PHYSICAL SCIENCE RESEARCH COUNCIL
View all
View less
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
Arc Routing
Mathematics
100%
Routing Problem
Mathematics
79%
Memetic Algorithm
Mathematics
68%
Neighborhood Search
Mathematics
38%
Dynamic Optimization Problems
Mathematics
36%
Incremental Learning
Mathematics
36%
Dynamic Environment
Mathematics
32%
Subset Sum Problem
Mathematics
31%
Research output
Research output per year
2008
2009
2010
2011
2011
9
Paper
9
Article
1
Conference contribution
Research output per year
Research output per year
A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem
Xing, LN.
,
Rohlfshagen, P.
,
Chen, YW.
&
Yao, X.
,
1 Aug 2011
,
In:
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
41
,
4
,
p. 1110-1123
14 p.
Research output
:
Contribution to journal
›
Article
Ants
100%
Heuristics
92%
Ant colony optimization
79%
Benchmarking
15%
Set theory
15%
52
Citations (Scopus)
Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
Mei, Y.
,
Tang, K.
&
Yao, X.
,
1 Apr 2011
,
In:
IEEE Transactions on Evolutionary Computation.
15
,
2
,
p. 151-165
15 p.
Research output
:
Contribution to journal
›
Article
Memetic Algorithm
100%
Arc Routing
97%
Routing Problem
77%
Decomposition
44%
Decompose
39%
142
Citations (Scopus)
Dynamic Combinatorial Optimisation Problems: An Analysis of the Subset Sum Problem
Rohlfshagen, P.
&
Yao, X.
,
1 Sep 2011
,
In:
Soft Computing.
15
,
9
,
p. 1723-1734
12 p.
Research output
:
Contribution to journal
›
Article
Subset Sum Problem
100%
Dynamic Optimization Problems
97%
Combinatorial optimization
73%
Combinatorial Optimization Problem
72%
Set theory
42%
18
Citations (Scopus)