439 research outputs found
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
A Quantum-Inspired Evolutionary Algorithm Based on P systems for a Class of Combinatorial Optimization
This paper introduces an evolutionary algorithm which uses the concepts
and principles of the quantum-inspired evolutionary approach and the hierarchical
arrangement of the compartments of a P system. The P system framework is
also used to formally specify this evolutionary algorithm. Extensive experiments are
conducted on a well-known combinatorial optimization problem, the knapsack problem,
to test the effectiveness of the approach. These experimental results show that
this evolutionary algorithm performs better than quantum-inspired evolutionary algorithms,
for certain arrangements of the compartments of the P system structure
utilized
Effect of Population Structures on Quantum-Inspired Evolutionary Algorithm
Quantum-inspired evolutionary algorithm (QEA) has been designed by integrating some quantum mechanical principles in the framework of evolutionary algorithms. They have been successfully employed as a computational technique in solving difficult optimization problems. It is well known that QEAs provide better balance between exploration and exploitation as compared to the conventional evolutionary algorithms. The population in QEA is evolved by variation operators, which move the Q-bit towards an attractor. A modification for improving the performance of QEA was proposed by changing the selection of attractors, namely, versatile QEA. The improvement attained by versatile QEA over QEA indicates the impact of population structure on the performance of QEA and motivates further investigation into employing fine-grained model. The QEA with fine-grained population model (FQEA) is similar to QEA with the exception that every individual is located in a unique position on a two-dimensional toroidal grid and has four neighbors amongst which it selects its attractor. Further, FQEA does not use migrations, which is employed by QEAs. This paper empirically investigates the effect of the three different population structures on the performance of QEA by solving well-known discrete benchmark optimization problems
A Membrane-Inspired Evolutionary Algorithm with a Population P System and its Application to Distribution System Recon guration
This paper develops a membrane-inspired evolutionary algorithm, PSMA,
which is designed by using a population P system and a quantum-inspired evolutionary
algorithm (QIEA). We use a population P system with three cells to organize three
types of QIEAs, where communications between cells are performed at the level of genes,
instead of the level of individuals reported in the existing membrane algorithms in the
literature. Knapsack problems are applied to discuss the parameter setting and to test
the effectiveness of PSMA. Experimental results show that PSMA is superior to four representative
QIEAs and our previous work with respect to the quality of solutions and the
elapsed time. We also use PSMA to solve the optimal distribution system reconfiguration
problem in power systems for minimizing the power loss.Junta de Andalucía P08-TIC-04200Ministerio de Ciencia e Innovación TIN-2009-1319
- …