Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature. Meta-heuristic approaches have proved to be quite useful for approximate solution of difficult combinatorial optimization problems. Ant colony optimization is one of the popular Meta-heuristics and is unique on the basis of its distributed computation and indirect communicatio...

Facility Layout Problem (FLP) is logic based combinatorial optimization problem. It is a meta-heuristic solution approach that gained significant attention to obtained optimal facility layout. This paper examines the convergence analysis by changing the crossover and mutation probability in an optimal facility layout. This algorithm is based on appropriate techniques that include multipoint swa...

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

The use of meta-heuristic optimization methods have become quite generic in the past two decades. This paper provides a theoretical investigation to find optimum design parameters of the Stirling heat engines using a recently presented nature-inspired method namely the gray wolf optimization (GWO). This algorithm is utilized for the maximization of the output power/thermal efficiency as well as...

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