This paper provides a detailed review of metaheuristic applications on discrete facility
location problems. The objective of this paper is to provide a concise summary of solution …

The p‐median problem is a network problem that was originally designed for, and has been
extensively applied to, facility location. In this bibliography, we summarize the literature on …

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP …

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP …

In this paper we present a new evolutionary method for complex-process optimization. It is
partially based on the principles of the scatter search methodology, but it makes use 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 …

This research develops a clustering‐based location‐allocation method to the Capacitated
Facility Location Problem (CFLP), which provides an approximate optimal solution to …

In this paper, we study the problem of multi-institutional regionalization of primary health
care units. The problem consists of deciding where to place new facilities, capacity …

As environmental awareness is becoming increasingly important, alternatives are needed
for the traditional forward product flows of supply chains. The field of reverse logistics covers …

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 …