The Vehicle Routing Problem with Multiple Trips is an extension of the classical Vehicle
Routing Problem in which each vehicle may perform several routes in the same planning …

The quadratic assignment problem (QAP) is a well-known combinatorial optimization
problem with a wide variety of applications, prominently including the facility location …

The successful handling of numerous real–world complex problems has increased the
popularity of nature–inspired intelligent (NII) algorithms and techniques. Their successful …

The capacitated centred clustering problem (CCCP) consists of defining a set of clusters with
limited capacity and maximum proper similarity per cluster. Each cluster is composed of …

In the capacitated p-median problem (CPMP), a set of n customers is to be partitioned into p
disjoint clusters, such that the total dissimilarity within each cluster is minimized subject to …

Clustering addresses the problem of assigning similar objects to groups. Since the size of
the clusters is often constrained in practical clustering applications, various capacitated …

The capacitated redistricting problem (CRP) has the objective to redefine, under a given
criterion, an initial set of districts of an urban area represented by a geographic network …

The improvement in the performance of computers and mathematical programming
techniques has led to the development of a new class of algorithms called matheuristics …

This paper presents a greedy randomized adaptive search procedure (GRASP) coupled
with path relinking (PR) to solve the problem of clustering n nodes in a graph into p clusters …

This paper addresses capacitated clustering based on majorization-minimization and
collaborative neurodynamic optimization (CNO). Capacitated clustering is formulated as a …