About this Journal Submit a Manuscript Table of Contents

Advanced Topics in Theory, Practice, and Application of Optimization Algorithms and Their Complexity

Call for Papers

Optimization is the selection process of a best solution in a set of available alternatives with regard to some criteria. In this field, it includes conventional mathematical programming algorithms, stochastic optimization algorithms, and heuristics and metaheuristics. Algorithms and their complexity are primary issue and study subject in optimization. The time complexity and space complexity are two aspects to analyze performance of an optimization algorithm. Since an algorithm's complexity may vary with different inputs of the same size, the studies of optimization complexity is an essential subject in optimization algorithm field.

This is special issue is intended to present and discuss algorithms and their complexity technologies, especially optimization algorithms and their complexity. The objective of this special issue is to establish the state of the art for the most relevant problems in different application fields and to emphasize new efficient implementations by applying optimization algorithm and analyzing their complexity. It is expected to address and report recent advanced topics in optimization algorithms and their complexity techniques and tools in both academic researches and real-world applications. The researches and applications of optimization algorithms and complexity with other disciplines are especially encouraged to be submitted to this special issue to present the latest research and development in this fast growing field.

Potential topics include but are not limited to the following:

  • Combinatorial optimization
  • Stochastic optimization
  • Infinite-dimensional optimization
  • Heuristics and metaheuristics
  • Constraint satisfaction
  • Programming
  • Multiobjective optimization
  • Multimodal optimization
  • New optimization algorithms development and their complexity analysis
  • Mechanics
  • Economics
  • Electrical engineering
  • Operations research
  • Control engineering
  • Molecular modeling
  • Design
  • Bioinformatics

Authors can submit their manuscripts through the Manuscript Tracking System at http://mts.hindawi.com/submit/journals/complexity/paoc/.

Manuscript DueFriday, 10 February 2017
First Round of ReviewsFriday, 5 May 2017
Publication DateFriday, 30 June 2017

Lead Guest Editor

  • Yan Pei, University of Aizu, Aizuwakamatsu, Japan

Guest Editors

  • Chang Shih-Hao, Tamkang University, Tamsui, Taiwan
  • Jia Hao, Beijing Institute of Technology, Beijing, China
  • Hai Jiang, Arkansas State University, Jonesboro, USA