[There
is a Special Issue in "Soft
Computing" Journal on Large Scale Optimization Guest
Edited by Manuel
Lozano & Francisco
Herrera. . For details, please follow this link.
]
Reference:
K. Tang, Xiaodong Li, P. N. Suganthan, Z. Yang and T. Weise, "Benchmark
Functions for the CEC'2010 Special Session and Competition on Large Scale
Global Optimization," Technical Report, Nature Inspired Computation and
Applications Laboratory, USTC, China, http://nical.ustc.edu.cn/cec10ss.php,
& Nanyang Technological University, 2009.
1. D. Molina, M. Lozano, and F. Herrera, "MA-SW-Chains: Memetic
Algorithm Based on Local Search Chains for Large Scale Continuous Global
Optimization", pp.3153-3160. (Winner of this competition)
2.
J. Brest, A. Zamuda, I.
Fister, M. S. Maucec, "Large Scale Global
Optimization using Self-adaptive Differential Evolution Algorithm",
pp.3097-3104.
3. H. Wang, Z. Wu, S. Rahnamayan and D. Jiang, "Sequential DE
Enhanced by Neighborhood Search for Large Scale
Global Optimization", pp.4056-4062.
4.
S.-Z Zhao, P. N. Suganthan, S. Das, "Dynamic Multi-Swarm Particle Swarm Optimizer with Subregional Harmony Search", pp.1983-1990.
5. P. Korosec, K. Tashkova, J. Silc, "The Differential Ant-Stigmergy Algorithm for Large-Scale Global Optimization", pp.4288-4295.
6. M.
N. Omidvar, X. Li, X.
Yao, "Cooperative Co-evolution with Delta Grouping for Large Scale
Non-separable Function Optimization", pp.1762-1769.
7.
Y.
Wang, B. Li, "Two-stage based Ensemble
Optimization for Large-Scale Global Optimization," pp.4488-4495.
8. S. Kukkonen, "Benchmarking the Classic Differential Evolution Algorithm on Large-Scale Global Optimization".
9. S. Chen, "Locust Swarms for Large Scale Global Optimization of Nonseparable Problems".
In the past
two decades, different kinds of nature-inspired optimization algorithms have
been developed and applied to solve optimization problems, including Simulated
Annealing (SA), Evolutionary Algorithms (EAs), Differential Evolution (DE),
Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Estimation of
Distribution Algorithms (EDA), etc. Although these approaches have shown
excellent search abilities when applying to some small or medium size problems,
many of them will encounter severe difficulties when applying to large scale problems, e.g., problems with up to 1000
variables. The reasons appear to be two-fold. First, the complexity of a
problem usually increases with the number of decision variables, number of
constraints, or even number of objectives (for multi-objective optimization).
This emergent complexity might prevent a previously successful search strategy
from finding the optimal solution. Second, the solution space of the problem
increases exponentially with the number of decision variables, and a more
efficient search strategy is required to explore all the promising regions with
limited computational resources.
Historically,
scaling up EAs to large scale problems has attracted
much interest, including both theoretical and practical studies. However,
existing work in the areas of EAs are still limited given the significance of
the scalability issue. Due to this fact, this special session is devoted to
highlight the recent advances in EAs for large scale
optimization problems, involving single objective or multiple objectives,
unconstrained or constrained problems, binary or discrete or real or mixed
decision variables. Specifically, we encourage interested researchers to submit
their latest work on:
A
competition on High-dimensional Numerical Optimization will also be organized in company with our special session.
The competition allows participants to run their own algorithms on 20 benchmark
functions, each of which is of 1000 dimensions. The purpose of this competition
is to compare different algorithm on the exactly same platform. The experiments
will take about 205 hours with the Matlab version on
a PC with 2.40GHz CPU, and 104 hours with the Java version on a PC with 2.2GHz
CPU. Each participant (or research group) is invited to submit a paper to the
special session to present their algorithm as well as
the results obtained. Details of the set of scalable functions and requirements
on the simulation procedure are available at http://nical.ustc.edu.cn/wcci2010/lsgo_benchmark.zip.
Researchers are welcome to apply any kind of computational intelligence
approaches (e.g. EAs, Neural Nets, fuzzy-based methods) to the test suite. The
results of this competition will be archived on our
web pages as done for the CEC 2008 competition on High-dimensional Function
Optimization.
Paper
Submission: |
January
31, 2010 |
Acceptance
Notification: |
March
15, 2010 |
Final
Manuscript Due: |
May
2, 2010 |
Manuscripts
should be prepared according to the standard format and page limit specified in
CEC 2010. For more submission instructions, please see the WCCI submission page
at: http://www.wcci2010.org/submission.
All
special session papers will be treated in the same way
as regular papers. All papers accepted by the special session will be included
in the CEC 2010 conference proceedings and selected authors will
be invited to present their results during WCCI 2010.
Notice:
When submitting, please make sure you have chosen "S01: Large
Scale Global Optimization" as the "Main Research
Topic".
Ke
Tang
Nature Inspired Computation and Applications Laboratory (NICAL)
School of Computer Science and Technology
University of Science and Technology of China, Hefei, Anhui, China
Email: ketang@ustc.edu.cn,
Website: http://staff.ustc.edu.cn/~ketang
Xiaodong
Li
School of Computer Science and Information Technology
RMIT University, Australia
Email:
P. N. Suganthan
School of Electrical and Electronic Engineering
Nanyang Technological University, Singapore
Email: epnsugan@ntu.edu.sg,
Website: http://www3.ntu.edu.sg/home/epnsugan