Nowadays computers are also used to solve incredibly complex problems. To solve these
problems we have to develop some advanced algorithms. Exact algorithms of such …

Simulated Annealing (SA) is one of the oldest metaheuristics and has been adapted to solve
many combinatorial optimization problems. Over the years, many authors have proposed …

Quadratic Assignment Problem (QAP) is an NP-hard combinatorial optimization problem,
therefore, solving the QAP requires applying one or more of the meta-heuristic algorithms …

A metaheuristic is conventionally described as an iterative generation process which guides
a servient heuristic by combining intelligently different concepts for exploring and exploiting …

Reactive power optimization problem has a substantial inspiration on secure and economic
operation of power system. In this work we utilized Hybridized Tabu Search-Simulated …

Transport network design problem (TNDP) is a well-studied problem for planning and
operations of transportation systems. They are widely used to determine links for capacity …

Performance comparisons between algorithms have a long tradition in metaheuristic
research. An early example is comparisons between Tabu Search (TS) and Simulated …

This article studies the problem of locating fuel stations to minimize the extra cost spent in
refueling detours, which belongs to a class of discretionary service facility location problems …

Given n facilities and a flow matrix, the single-row equidistant facility layout problem
(SREFLP) is to find a one-to-one assignment of n facilities to n locations equally spaced …

In recent years, there has been an increasing interest in service composition due to its
importance in practical applications. At the same time, clouds are becoming an important …