Journal of Optimization

Metaheuristic Optimization: Algorithmic Design and Applications


Status
Published

Lead Editor

1Southwest Jiaotong University, Chengdu, China

2Huazhong University of Science and Technology, Wuhan, China

3De Montfort University, Leicester, UK

4Xidian University, Xi'an, China

5Università degli Studi di Milano-Bicocca, Milano, Italy


Metaheuristic Optimization: Algorithmic Design and Applications

Description

After the No Free Lunch Theorems (NFLT), twenty years ago, the necessity of designing algorithms which specifically address some problems was expressed. As a result, the approach of designing algorithm on the basis of the most various inspirations (genetics, behavior of birds, fish, etc.) and with general purpose has been replaced by a design especially tailored to solve the problems. This modern and rapidly growing interpretation of optimization problems and algorithms is referred to with several notations according to some design differences and philosophy underneath. We will use the comprehensive term “Metaheuristic Optimization.”

Modern Metaheuristic Optimization approaches can be divided into two main categories: algorithms that perform change during the run on the basis of the success of the components thus adapting to the problem and algorithms that are designed after a thorough problem examination. These two approaches can be applied in both algorithm design studies and real-world applications.

This special issue focuses on novel modern Metaheuristic Optimization algorithms, that is, algorithmic approaches that, in accordance with the NFLT, integrate the problem and its features within the optimization process. More specifically, the articles in this special issue will focus on the design of the metaheuristics that take into account the problem features; thus the problem algorithm appears in some way in the search algorithm that tackles it either at design time or at run time. Opposite to the common practice of designing algorithms by randomly combining existing algorithms or perturbing and complicating successful algorithmic framework, we are interested in investing those approaches where each algorithmic component is thoughtfully used to tackle the challenges posed by the specific problem.

Prospective authors from academia and industry are invited to submit their original and unpublished contributions to this special issue. Studies focusing on novel algorithm design approaches and attractive real-world applications are both welcome.

Potential topics include but are not limited to the following:

  • Hyperheuristic algorithms
  • Memetic computing
  • Adaptive and self-adaptive schemes
  • Membrane computing algorithms
  • Fitness landscape analysis
  • Problem examination techniques
  • Studies on problem features, such as separability, ill-conditioning, and multimodality
  • Theoretical studies about algorithm functioning
  • Domain specific implementation

Articles

  • Special Issue
  • - Volume 2017
  • - Article ID 1053145
  • - Editorial

Metaheuristic Optimization: Algorithmic Design and Applications

Gexiang Zhang | Linqiang Pan | ... | Alberto Leporati
  • Special Issue
  • - Volume 2017
  • - Article ID 9710719
  • - Research Article

Robust Circle Detection Using Harmony Search

Jaco Fourie
  • Special Issue
  • - Volume 2017
  • - Article ID 8042436
  • - Research Article

Improving the Fine-Tuning of Metaheuristics: An Approach Combining Design of Experiments and Racing Algorithms

Eduardo Batista de Moraes Barbosa | Edson Luiz França Senne
  • Special Issue
  • - Volume 2017
  • - Article ID 5650364
  • - Research Article

A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

Saad Alharbi | Ibrahim Venkat
  • Special Issue
  • - Volume 2017
  • - Article ID 5723239
  • - Research Article

A NNIA Scheme for Timetabling Problems

Yu Lei | Jiao Shi
  • Special Issue
  • - Volume 2017
  • - Article ID 4093973
  • - Research Article

The Research of Disease Spots Extraction Based on Evolutionary Algorithm

Kangshun Li | Lu Xiong | ... | Yu Xue
  • Special Issue
  • - Volume 2017
  • - Article ID 4685923
  • - Research Article

A Novel Distributed Quantum-Behaved Particle Swarm Optimization

Yangyang Li | Zhenghan Chen | ... | Yu Xue
  • Special Issue
  • - Volume 2017
  • - Article ID 3259140
  • - Research Article

A Multiple Core Execution for Multiobjective Binary Particle Swarm Optimization Feature Selection Method with the Kernel P System Framework

Naeimeh Elkhani | Ravie Chandren Muniyandi
  • Special Issue
  • - Volume 2017
  • - Article ID 8063767
  • - Research Article

A Hybrid Multiobjective Discrete Particle Swarm Optimization Algorithm for Cooperative Air Combat DWTA

Guang Peng | Yangwang Fang | ... | Dandan Yang
  • Special Issue
  • - Volume 2017
  • - Article ID 8936164
  • - Research Article

An Improved Heuristic Algorithm for UCAV Path Planning

Kun Zhang | Peipei Liu | ... | Min Liu
Journal of Optimization
 Journal metrics

Metrics will be available once more articles are published.

 Submit