This paper examines the factors affecting the quality of solution found by meta-heuristic search when optimising object-oriented software class models. From the algorithmic perspective, we examine the effect of encoding, choice of components such as the global search heuristic, and various means of incorporating problemand instance-specific information. We also consider the effect of problem ch...

This paper presents a comprehensive survey of the meta-heuristic optimization algorithms on text clustering applications and highlights its main procedures. These Artificial Intelligence (AI) are recognized as promising swarm intelligence methods due to their successful ability solve machine learning problems, especially problems. reviews all relevant literature meta-heuristic-based application...

A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter...

Preventive healthcare aims at reducing the likelihood and severity of potentially life-threatening illnesses by protection and early detection. In this paper, a bi-objective mathematical model is proposed to design a network of preventive healthcare facilities so as to minimize total travel and waiting time as well as establishment and staffing cost. Moreover, each facility acts as M/M/1 queuin...

Meta-heuristic methods represent very powerful tools for dealing with hard combinatorial optimization problems. However, real life instances usually cannot be treated efficiently in "reasonable" computing times. Moreover, a major issue in metaheuristic design and calibration is to make them robust, i.e., to provide high performance solutions for a variety of problem settings. Parallel meta-heur...

The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

vehicular ad-hoc network (vanet) is an important component of intelligent transportation systems, in which vehicles are equipped with on-board computing and communication devices which enable vehicle-to-vehicle communication. consequently, with regard to larger communication due to the greater number of vehicles, stability of connectivity would be a challenging problem. clustering technique as ...