Most web search results clustering (SRC) strategies have predominantly studied the definition of adapted representation spaces to the detriment of new clustering techniques to improve performance. In this paper, we define SRC as a multi-objective optimization (MOO) problem to take advantage of most recent works in clustering. In particular, we define two objective functions (compactness and sep...

The large neighborhood search (LNS) framework introduced by Shaw [11] provides a powerful hybridization of Local Search (LS) and Constraint Programming (CP). The idea of LNS is to combine the expressiveness of CP and the efciency of Local Search (LS) without requiring any meta-heuristic. LNS consists in improving a best-so-far solution by iteratively relaxing it and optimizing this solution usi...

We propose a new Pareto Local Search Algorithm for the many-objective combinatorial optimization. Pareto Local Search proved to be a very effective tool in the case of the bi-objective combinatorial optimization and it was used in a number of the state-of-the-art algorithms for problems of this kind. On the other hand, the standard Pareto Local Search algorithm becomes very inefficient for prob...

Russian Doll Search (RDS) is a well-known algorithm for combinatorial optimization. In this paper we extend it from mono-objective to multi-objective optimization. We demonstrate its practical applicability in the challenging multipleorbit SPOT5 instances. Besides being much more efficient than any other alternatives, multi-objective RDS can solve an instance which could not have been solved pr...

The Max-Cut problem consists of finding a partition of the nodes of a weighted graph into two subsets such that the sum of the weights between both sets is maximized. This is an NP-hard problem that can also be formulated as an integer quadratic program. Several solution methods have been developed since the 1970s and applied to a variety of fields, particularly in engineering and layout design...

Abstract It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Programming. This paper is an explanation the use multi-objective optimisation contrast simple additive weighting techniques with a view develop CSPs. A hierarchical scheme employed select candidate strategy from Pareto frontier final...

Project scheduling has received a growing attention from researchers for the last decades in order to propose models and methods to tackle scheduling problems for real-size projects. In this paper, we consider the resource-constrained project scheduling problem (RCPSP), which consists in scheduling the activities in order to minimize the project duration in presence of precedence and resource c...

OBJECTIVE The goal of this paper is to undertake a literature search collecting all dentin bond strength data obtained for six adhesives with four tests (shear, microshear, tensile and microtensile) and to critically analyze the results with respect to average bond strength, coefficient of variation, mode of failure and product ranking. METHOD A PubMed search was carried out for the years bet...