Biased Random-Key Genetic Algorithm

The p-next center problem with capacity and coverage radius constraints: model and heuristics

This paper introduces a novel problem of facility location, called the p-next center problem with capacity and coverage radius constraints. We formulate a mixed integer programming model for this problem, and compare the results found by CPLEX with …

Exact and heuristic approaches for the root sequence index allocation problem

In mobile wireless networks, the Root Sequence Index (RSI) is used to allocate uplink channels between the user equipment and the base station. The assignment of RSIs close-in-range to neighbor radios may cause collisions leading to failures on …

The p-next center problem with capacity and coverage radius constraints: model and heuristics

This paper introduces a novel problem of facility location, called the p-next center problem with capacity and coverage radius constraints. We formulate a mixed integer programming model for this problem, and compare the results found by CPLEX with …

An evolutionary approach for the p-next center problem

The p-next center problem is an extension of the classical p-center problem, in which a backup center must be assigned to welcome users from a suddenly unavailable center. Usually, users tend to seek help in the closest facility they can find. …

Evolutionary algorithms for overlapping correlation clustering

In Overlapping Correlation Clustering (OCC), a number of objects are assigned to clusters. Two objects in the same cluster have correlated characteristics. As opposed to traditional clustering where objects are assigned to a single cluster, in OCC …

Evolutionary algorithms for overlapping correlation clustering

Solving the winner determination problem by biased random-key genetic algorithms