The Capacitated Centred Clustering Problem (CCCP) consists in partitioning a set of n points into p disjoint clusters with a known capacity. Each cluster is specified by a centroid. The objective is to minimize the total dissimilarity within each cluster, such that a given capacity limit of the cluster is not exceeded. This paper presents a solution procedure for the CCCP, using the hybrid meta...

In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...

Capacitated Centered Clustering problem (CPMP) is an important variation of p-median problems. The p-median problems are known to be NP-hard. A hybrid genetic algorithm is used to solve the problem efficiently. The analysis shows that the performance of the proposed algorithm is better than the traditional local search heuristic.

The Capacitated Clustering Problem (CCP) partitions a set of n items (eg. customer orders) into k disjoint clusters with known capacity. During clustering the items with shortest assigning paths from centroids are grouped together. The summation of grouped items should not exceed the capacity of cluster. All clusters have uniform capacity. The CCP is NP-Complete and Combinatorial optimization p...

This paper presents the Clustering Search (CS) as a new hybrid metaheuristic, which works in conjunction with other metaheuristics, managing the implementation of local search algorithms for optimization problems. Usually the local search is costly and should be used only in promising regions of the search space. The CS assists in the discovery of these regions by dividing the search space into...

Vehicle Routing Problem (VRP) has become an integral part in logistic operations which determines optimal routes for several vehicles to serve customers. The basic version of VRP is Capacitated VRP (CVRP) which considers equal capacities for all vehicles. The objective of CVRP is to minimize the total traveling distance of all vehicles to serve all the customers. Various methods are used to sol...

In this paper, we study the uniform capacitated k-median problem. In the problem, we are given a set F of potential facility locations, a set C of clients, a metric d over F ∪ C, an upper bound k on the number of facilities we can open and an upper bound u on the number of clients each facility can serve. We need to open a subset S ⊆ F of k facilities and connect clients in C to facilities in S...