In their search for satisfactory solutions to complex combinatorial problems, metaheuristics methods are expected to intelligently explore the solution space. Various forms of memory have been used to achieve this goal and improve the performance of metaheuristics, which warranted the development of the Adaptive Memory Programming (AMP) framework [1]. This paper follows this framework by integr...

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, ...

Node cooperation can protect wireless networks from eavesdropping by using the physical characteristics of wireless channels rather than cryptographic methods. Allocating the proper amount of power to cooperative nodes is a challenging task. In this paper, we use three cooperative nodes, one as relay to increase throughput at the destination and two friendly jammers to degrade eavesdropper&rsqu...

This article describes the origin and significant developments associated with the field of meta-heuristics as they relate to global optimization. Meta-heuristics provide a means for approximately solving complex optimization problems. These methods are designed to search for global optima; however, they cannot guarantee that the best solution found after termination criteria are satisfied is i...

Meta-reasoning can improve numerous search algorithms, but necessitates collection of statistics to be used as probability distributions, and involves restrictive meta-reasoning assumptions. The recently suggested scheme of type systems in search algorithms is used in this paper for collecting these statistics. The statistics are then used to better estimate the unknown quantity of expected reg...

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

In this paper we prove that in some practical situations, there is a free lunch for hyper-heuristics, i.e., search algorithms that search the space of solvers, searchers, meta-heuristics and heuristics for problems.

Facing supply uncertainty of bulky wastes, the capacitated multi-product stochastic network design model for bulky waste recycling is proposed in this paper. The objective of this model is to minimize the first-stage total fixed costs and the expected value of the second-stage variable costs. The possibility of operation costs and transportation costs for bulky waste recycling is considered ...

We propose a synergistic approach to meta-heuristic search optimization algorithm. The fine balance between intensification (exploitation) and diversification (exploration) is very important to the overall efficiency and performance of a meta-heuristic search algorithm. Too little exploration and too much exploitation could cause the system to be trapped in local optima, which makes it very dif...