This paper presents an Iterated Tabu Search algorithm (denoted by ITSPUCC) for solving the problem of Packing Unequal Circles in a Circle. The algorithm exploits the continuous and combinatorial nature of the unequal circles packing problem. It uses a continuous local optimization method to generate locally optimal packings. Meanwhile, it builds a neighborhood structure on the set of local mini...

Given a set of n elements separated by a pairwise distance matrix, the minimum differential dispersion problem (Min-Diff DP) aims to identify a subset ofm elements (m < n) such that the difference between the maximum sum and the minimum sum of the inter-element distances between any two chosen elements is minimized. We propose an effective iterated local search (denoted by ILS MinDiff) for Min-...

Designing effective algorithms to solve cross-domain combinatorial optimization problems is an important goal for which manifold search methods have been extensively investigated. However, finding optimal combination of perturbation operations solving hard because the different characteristics each problem and discrepancies in strengths operations. The algorithm that works effectively one domai...

Most public facilities in the European countries, including France, Germany, and United Kingdom, were built during reconstruction projects between 1950 1980. Owing to deteriorating state of such vital infrastructure, its maintenance has become relatively expensive recent decades. A significant part operation costs is spent on technical staff. Therefore, optimal use available workforce essential...

Iterated local search (ILS) is a surprisingly simple but at the same time powerful metaheuristic for nding high quality approximate solutions for combinatorial optimization problems. ILS is based on the repeated application of a local search algorithm to initial solution which are obtained by mutations of previously found local optima | in most ILS algorithms these mutations are applied to the ...