this comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. optimization of the collection bin and recycle bin loca...

Many types of facility location/allocation models have been developed to find optimal spatial patterns with respect to location criteria such as: cost, time, coverage, and access. In this paper we develop and test location modeling formulations that utilize aspects of the data envelopment analysis (DEA) efficiency measure to find optimal and efficient facility location/allocation patterns. Solv...

This comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. Although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. Optimization of the collection bin and recycle bin loca...

This comprehensive work explores the research performed inoptimization of the collection bin and in recycle bin location-allocation issues in solidwaste management. Although the collection phase of solid waste management accountsfor a significant proportion of the municipal budget, it has attracted only limitedattention of the researchers. Optimization of the collection bin and recycle bin loca...

Location-allocation problems arise in several contexts, including supply chain and data mining. In its most common interpretation, the basic problem consists of optimally locating facilities and allocating customers to facilities so as to minimize the total cost. The standard approach to solving location-allocation problems is to model alternative location sites and customers as discrete entiti...

majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. however in real-world applications, these assumptions are not well-matched with reality. in this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the cap...

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...

Facility location allocation problem is a very important issue in today's global logistic management. Various facility location problems have been considered in operations research under somehow stringent conditions to reduce the search space. In this paper, we consider a class of single source capacitated facility location allocation problems that can assume more realistic conditions in real l...

the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...