Open AccessA genetic algorithm to solve a three-echelon capacitated location problem for a distribution center within a solid waste management system in the northern region of Veracruz, Mexico
Author(s) -
María del Rosario Pérez-Salazar,
Nicolás Francisco Mateo-Díaz,
Rogelio García-Rodríguez,
Carlos Eusebio Mar-Orozco,
Lidilia Cruz-Rivero
Publication year - 2015
Publication title -
dyna
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.164
H-Index - 18
eISSN - 2346-2183
pISSN - 0012-7353
DOI - 10.15446/dyna.v82n191.51146
Subject(s) - facility location problem , distribution center , genetic algorithm , municipal solid waste , location model , center (category theory) , integer programming , order (exchange) , operations research , integer (computer science) , mathematical optimization , computer science , set (abstract data type) , business , mathematics , engineering , waste management , marketing , programming language , chemistry , finance , crystallography
Mexico is the world’s third largest consumer of Polyethylene Terephthalate (PET), only preceded by the United States and China. PET is commonly used in plastic containers such as beverage bottles and food packaging. It can be argued that the main problem regarding pollution generated by PET waste lies in the lack of appropriate solid waste management. The decision regarding facility location is the central issue in solid waste management. A mixed integer linear programming model of the capacitated facility location problem is proposed and then a genetic algorithm is designed to optimize the model. The problem is described as follows: given the quantities of PET generated in the northern region of Veracruz, Mexico, by considering five cities and each as a single generation source, a collection center has to be selected among a set of pre-identified locations in the town of Tempoal, Veracruz; in order to serve a set of demand points in the re-use market; demands are assumed to be uncertain. The aim is to minimize the system’s overall cost.