A methodological proposal to determine the optimal levels of inter-municipal cooperation in the organization of solid waste management systems.

The paper proposes a procedure based on data envelopment analysis (DEA) in order to identify the optimal dimension for inter-municipal cooperation in waste management. Given: (a) a set of decision making units (DMUs) and a production process that virtually transforms municipal expenditure in different amounts of sorted and unsorted waste, (b) a set of exogenous variables conditioning the operational environment of the DMUs and (c) a variable used for measuring the dimension of inter-municipal cooperation, the procedure realizes an iterative correction of input values and efficiency scores to purge, first, the effects of the exogenous variables, and then those of the dimensional variable. In this way, an indicator of the impact of the dimensional variable on the efficiency is obtained for each of the observed DMUs. An application on waste collection services is proposed using data relative to a set of Italian DMUs with a population ranging between 20,000 and 300,000. The results show that DMUs not exceeding the total population of around 55,000 (upper bound of the eighth population decile) provide the best solution for inter-municipal cooperation. Over that level, increases of the population consistently worsen average efficiency (the mean of the impact of the dimensional variable on efficiency scores more than doubles from the eighth to the ninth decile and more than quintuples from the eighth to the last decile). The procedure can be applied to different regional and national contexts and even to inter-municipal cooperation concerning other public services.

Informations de copyright

Copyright © 2020 Elsevier Ltd. All rights reserved.

Déclaration de conflit d'intérêts

Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.