Optimal Location of Electronic Charity Boxes Using a Hybrid Mathematical Model of Chance Constrained Goal Programming and EDAS Method

Using mathematical modeling of the location problem is effective in optimization of the location of electronic charity boxes. This paper investigates the effective criteria of amount of donation in each district and each type of location, following the determination of study districts, identifying types of locations and extracting conventional charity boxes information. The objectives of the model are to maximize the total amount of benefit and amount of donation motivation. In order to extract the donation motivation at any potential location, a number of criteria using the evaluation based on distance from average solution (EDAS) method are used, including district impact factor, location type impact factor, and human traffic factor. The constraints of the problem are defined as building the culture and prevention of accumulation of e-charity boxes at any district and any type of location. Due to the multi-objective model and the randomness of the amount of benefit and the human traffic factor at any potential location,  two objectives have been used as a chance-constrained goal programming model, which after changing from a stochastic multi-objective model to a deterministic single-objective one and setting the parameters, 60 locations are extracted as the final locations.