{"title":"污水处理厂选址的广义弯曲分解","authors":"A. Vatsa, Saurabh Chandra","doi":"10.2139/ssrn.3564223","DOIUrl":null,"url":null,"abstract":"Pollution of freshwater sources is a major problem in many developing economies. Environmental norms mandate that Industrial wastewater must be treated before releasing it in the environment or recycling. Apart from large enterprises, many medium and small-scale enterprises use water for industrial purposes. However, many of these enterprises do not have enough financial resources to set up their own wastewater treatment plant (WWTP). Government policies encourage establishing a common set of WWTPs that can service all the enterprises in an industrial cluster and will be more economical to operate. We formulate the problem of locating WWTPs of appropriate sizes and allocating polluting firms to them as a Mixed Integer Non-linear Program (MINLP). The model minimizes the setup cost and the operating cost for the network of WWTPs. For the operating cost, empirical evidence shows that there exist economies of scale with wastewater volume and dis-economies of scale with pollutant concentration. Hence, the operating cost function is non-convex. We provide an exact convexification strategy for this problem. Still, the commercial solvers are unable to solve practical size instances. Therefore, we propose a Generalized Benders decomposition based algorithm with many refinements. We exploit the structure of the problem to solve the sub-problem very efficiently. Our proposed method can solve this MINLP much more efficiently than commercial solvers.","PeriodicalId":320822,"journal":{"name":"Development Economics: Agriculture","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized Benders Decomposition for Location-Allocation of Wastewater Treatment Plants\",\"authors\":\"A. Vatsa, Saurabh Chandra\",\"doi\":\"10.2139/ssrn.3564223\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pollution of freshwater sources is a major problem in many developing economies. Environmental norms mandate that Industrial wastewater must be treated before releasing it in the environment or recycling. Apart from large enterprises, many medium and small-scale enterprises use water for industrial purposes. However, many of these enterprises do not have enough financial resources to set up their own wastewater treatment plant (WWTP). Government policies encourage establishing a common set of WWTPs that can service all the enterprises in an industrial cluster and will be more economical to operate. We formulate the problem of locating WWTPs of appropriate sizes and allocating polluting firms to them as a Mixed Integer Non-linear Program (MINLP). The model minimizes the setup cost and the operating cost for the network of WWTPs. For the operating cost, empirical evidence shows that there exist economies of scale with wastewater volume and dis-economies of scale with pollutant concentration. Hence, the operating cost function is non-convex. We provide an exact convexification strategy for this problem. Still, the commercial solvers are unable to solve practical size instances. Therefore, we propose a Generalized Benders decomposition based algorithm with many refinements. We exploit the structure of the problem to solve the sub-problem very efficiently. Our proposed method can solve this MINLP much more efficiently than commercial solvers.\",\"PeriodicalId\":320822,\"journal\":{\"name\":\"Development Economics: Agriculture\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Development Economics: Agriculture\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3564223\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Development Economics: Agriculture","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3564223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generalized Benders Decomposition for Location-Allocation of Wastewater Treatment Plants
Pollution of freshwater sources is a major problem in many developing economies. Environmental norms mandate that Industrial wastewater must be treated before releasing it in the environment or recycling. Apart from large enterprises, many medium and small-scale enterprises use water for industrial purposes. However, many of these enterprises do not have enough financial resources to set up their own wastewater treatment plant (WWTP). Government policies encourage establishing a common set of WWTPs that can service all the enterprises in an industrial cluster and will be more economical to operate. We formulate the problem of locating WWTPs of appropriate sizes and allocating polluting firms to them as a Mixed Integer Non-linear Program (MINLP). The model minimizes the setup cost and the operating cost for the network of WWTPs. For the operating cost, empirical evidence shows that there exist economies of scale with wastewater volume and dis-economies of scale with pollutant concentration. Hence, the operating cost function is non-convex. We provide an exact convexification strategy for this problem. Still, the commercial solvers are unable to solve practical size instances. Therefore, we propose a Generalized Benders decomposition based algorithm with many refinements. We exploit the structure of the problem to solve the sub-problem very efficiently. Our proposed method can solve this MINLP much more efficiently than commercial solvers.