Meta-heuristic algorithms are well-known optimization methods, for solving real-world problems. Harmony search (HS) is a recognized meta-heuristic algorithm with an efficient exploration process. But the HS has slow convergence rate, which causes to have weak exploitation process in finding global optima. Different variants of introduced literature enhance and fix its problems, but most cases, ...

Hyper-heuristics are (meta-)heuristics that operate at a high level to choose or generate a set of low-level (meta-)heuristics to solve difficult search and optimisation problems. Evolutionary algorithms are well-known natureinspired meta-heuristics that simulate Darwinian evolution. In this article, we introduce an evolutionary-based hyper-heuristic in which a set of low-level heuristics compe...

This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain opt...

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...

this paper presents a new meta-heuristic solution to find the efficient frontier using the mean-variance approach. portfolio optimization problem is a quadratic programming model and, changes to np-hard if the number of assets and constraints has increased, and it cannot be solved using common mathematical methods in a reasonable time. therefore, a heuristic or meta-heuristic algorithm should b...

In this paper, a new codification is proposed for variousmeta-heuristic techniques to solve the reconfiguration problem of distribution networks. The full potential of meta-heuristic algorithms can be exploited by their efficient codification using some engineering knowledge base. The distribution system reconfiguration problems are non-differentiable, mixed integer and highly complex combinato...

A new Meta heuristic approach called ”Randomized gravitational emulation search algorithm (RGES)” for solving vertex covering problems has been designed. This algorithm is found upon introducing randomization concept along with the two of the four primary parameters ’velocity’ and ’gravity’ in physics. A new heuristic operator is introduced in the domain of RGES to maintain feasibility specific...

A new Meta heuristic approach called ”Randomized gravitational emulation search algorithm (RGES)” for solving large size set covering problems has been designed. This algorithm is found upon introducing randomization concept along with the two of the four primary parameters ’velocity’ and ’gravity’ in physics. A new heuristic operator is introduced in the domain of RGES to maintain feasibility ...

Services are the basic amass that aims to support the building of business application in a more flexible and interoperable manner for enterprise collaboration. Satisfying the needs of service consumer and to become accustomed to changing needs, service composition is performed to compose the various capabilities of available services. With the proliferation of services presenting similar funct...