Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...