Skip to content

Capacitated clustering problem (CCP) solved using Gurobi and heuristic optimization like LP-and-fix and size reduction.

Notifications You must be signed in to change notification settings

castroisabel/capacitated-clustering

Repository files navigation

capacitated-clustering

The Capacitated Clustering Problem (CCP) consists of forming a specified number of clusters or groups from a set of elements in such a way that the sum of the weights of the elements in each cluster is within some capacity limits, and the sum of the benefits between the pairs of elements in the same cluster is maximized. This problem arises in the context of facility planners at mail processing and distribution.

For this problem, we use Gurobi Optimizer with LP-and-fix heuristic and Size reduction heuristic.

About

Capacitated clustering problem (CCP) solved using Gurobi and heuristic optimization like LP-and-fix and size reduction.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages