This paper presents two effective algorithms for clustering n entities into p mutually exclusive
and exhaustive groups where the 'size'of each group is restricted. As its objective, the …

Operation of on-demand services like taxis, dynamic ridesharing services, or vehicle sharing
depends significantly on the positioning of idle vehicles to anticipate future demand and …

Because of their widespread applicability, the set covering location problem and the
maximal covering location problem have received considerable attention in the facility …

In this paper we present a lower bound for the capacitated warehouse location problem
based upon the Lagrangean relaxation of a mixed-integer formulation of the problem, where …

In this paper we present two lower bounds for the p-median problem, the problem of locating
p facilities (medians) on a network. These bounds are based on two separate lagrangean …

Genetic algorithms (GAs) have recently been accepted as powerful approaches to solving
optimization problems. It is also well-accepted that building block construction (schemata …

The purpose of this book is to provide readers with an introduction to the fields of decision
making, location analysis, and project and machine scheduling. The combination of these …

There has been considerable interest in the development of analysis techniques for
Geographical Information Systems (GIS). This includes such normative spatial models as …

In this paper, a bi-level model is introduced to evaluate the capacitated p-median facility
location problem with the most likely allocation solution. The classical capacitated p-median …

The facility location problem (FLP) involves optimally locating a set of facilities that must
satisfy the demands of a group of customers distributed in a planar area. Traditionally …