This study presents a capacitated multi-facility location-allocation problem with stochastic demands based on a well-known distribution function. In this discrete environment, besides the capacitated facilities, we can employee the capacitated sub-source of each facility for satisfying demands of customers. The objective function is to find the optimal locations of facilities among a finite num...

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

distribution centers (dcs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.this paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. an evolutionary algorithm named non-dominated sorting ant colony optimization (nsaco) is used as the optimi...

The deployment of edge computing infrastructure requires a careful placement the servers, with an aim to improve application latencies and reduce data transfer load in opportunistic Internet Things systems. In server placement, it is important consider capacity, available budget, hardware requirements for servers underlying backbone network topology. this paper, we thoroughly survey existing li...

Entitled: Metaheuristics for multiobjective capacitated location allocation on logistics networks and submitted in partial fulfillment of the requirements for the degree of complies with the regulations of the University and meets the accepted standards with respect to originality and quality. ABSTRACT Metaheuristics for multiobjective capacitated location allocation on logistics networks Yongl...

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...

In this paper we consider a capacitated single allocation p-hub median problem (CSApHMP) which is to determine the location of p hubs, the allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total transportation cost and fixed cost of the selected p hubs. Since the CSApHMP is NP-hard...

In this paper we consider a capacitated single allocation p-hub median problem with multiple capacity levels (CSApHMPMC) in which the decisions are to determine the location of p hubs and their capacity levels, the single allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total tran...

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