In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destination, the flows are concentrated with others at facilities called hubs. These flows are transported ...

The design and management of a multi-stage production/distribution system is one of the most critical problem in logistics and in facility management. This manuscript deals with the so called facility locationallocation problem, i.e. with the simultaneous decisions regarding the design, management, and control of a distribution network. In particular the logistic problem object of this study de...

Our study is concerned with the development of an Emergency Medical Services (EMS) ambulance location and allocation model called the Time-based Ambulance Zoning Optimization Model (TAZ_OPT). This paper presents the framework of the study. The model is formulated using the goal programming (GP), where the goals are to determine the satellite locations of ambulances and the number of ambulances ...

Capacitated location-allocation problem with stochastic demands is originally formulated as expected value model, chance-constrained programming and dependent-chance programming according to different criteria. For solving these stochastic models efficiently, the network simplex algorithm, stochastic simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Fina...

This paper deals with a planning problem arising in large logistics companies. The problem consists in defining the optimal number of depots, their location, and their size as well as the routing decisions. Economies of scale are present both in the transportation and in the depots operations. The paper proposes an exact algorithm and an efficient heuristic based on the integration of tabu sear...

In order to model capacitated location-allocation problem with fuzzy demands, three types of fuzzy programming models — fuzzy expected cost minimization model, fuzzy α-cost minimization model, and credibility maximization model — are proposed according to different decision criteria. For solving these models, some hybrid intelligent algorithms are also designed. Finally, several numerical exper...

The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering locationallocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This pa...

A different approach to the capacitated single allocation hub location problem is presented. Instead of using capacity constraints to limit the amount of flow that can be received by the hubs, we introduce a second objective function to the model (besides the traditional cost minimizing function), that tries to minimize the time to process the flow entering the hubs. Two bi-criteria single allo...

In this paper we consider the problem of locating N new facilities with respect to M existing facilities in the plane and in the presence of polyhedral barriers. We assume that a barrier is a region where neither facility location nor traveling is permitted. For the resulting multi-dimensional mixed-integer optimization problem two different alternate location and allocation procedures are deve...