This paper determines the optimal location of K connections in the plane, where a connection links pairs of existing facilities. Both uncapacitated and capacitated versions of the problem are considered. Discretization results for general polyhedral gauges and other properties are established. Two heuristic algorithms are developed for each case using the concept of a shortest path flow set cou...

Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. This model...

This study proposes a bi-objective model for capacitated multi-vehicle allocation of customers to potential distribution centers (DCs).The optimization objectives are to minimize transit time and total cost including opening cost, assumed for opening potential DCs and shipping cost from DCs to the customers where considering heterogeneous vehicles lead to a more realistic model and cause more c...

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...

We consider the problem of finding a popular matching in the Weighted Capacitated House Allocation problem (WCHA). An instance of WCHA involves a set of agents and a set of houses. Each agent has a positive weight indicating his priority, and a preference list in which a subset of houses are ranked in strict order. Each house has a capacity that indicates the maximum number of agents who could ...

In this chapter, we present a procedure that seeks the global minimum for the capacitated Euclidean location-allocation problem which is defined as follows. Given the fixed location of m existing facilities or customers on a continuous plane and their associated demands, we wish to determine the location of n new facilities or sources with known capacities, and the allocation of its supply, in ...

Multi-objective capacitated multiple allocation hub location problem (MOCMAHLP) is a variation of classic problem, which deals with network design, considering both the number and hubs connections between spokes, as well routing flow on network. In this study, we offer two meta-heuristic approaches based non-dominated sorting genetic algorithm (NSGA-II) archived multi-objective simulated anneal...

Abstract. Location-allocation is a key tool within the GIS and network analysis toolbox. In this paper we discuss real world application of location-allocation case study (approx 800 students, 500 schools) from UCL using public transport. The use transportation for study, as many approaches only make drive-time or walking-time distances, but location in Greater London, UK makes inclusion transp...