
Abstract Few activities are as crucial in urban environments as waste management. Mismanagement of waste can cause significant economic, social, and environmental damage. However, waste management is often a complex system to manage and therefore where computational decision-support tools can play a pivotal role in assisting managers to make faster and better decisions. In this sense, this article proposes, on the one hand, a unified optimization model to address two common waste management system optimization problem: the determination of the capacity of waste bins in the collection network and the design and scheduling of collection routes. The integration of these two problems is not usual in the literature since each of them separately is already a major computational challenge. Two improved exact formulations based on mathematical programming and two metaheuristic methods are provided to solve this proposed unified optimization model. It should be noted that the metaheuristics consider a mixed chromosome representation of the solutions combining binary and integer alleles, in order to solve realistic instances of this complex problem. Different parameters of the metaheuristics considered – a Genetic Algorithm and a Simulated Annealing algorithm – have been tested to study which combination of them obtained better results in execution times on the order of that of the exact solvers. The achieved results show that the proposed metaheuristic methods perform efficient on large instances, where exact formulations are not applicable, and offer feasible, high-quality solutions in reasonable calculation times.
FOS: Computer and information sciences, PERIODIC CAPACITATED VEHICLE ROUTING PROBLEM, Transportation, logistics and supply chain management, mixed integer programming, Capacitated facility location problem, genetic algorithms, periodic capacitated vehicle routing problem, CAPACITATED FACILITY LOCATION PROBLEM, Mixed integer programming, Deterministic network models in operations research, 332907 Transporte, FOS: Mathematics, Neural and Evolutionary Computing (cs.NE), https://purl.org/becyt/ford/2, Waste management, Mathematics - Optimization and Control, 120315 Heurística, GENETIC ALGORITHMS, Simulated annealing algorithms, MIXED INTEGER PROGRAMMING, capacitated facility location problem, Computer Science - Neural and Evolutionary Computing, Genetic algorithms, Approximation methods and heuristics in mathematical programming, 330807 Eliminación de residuos, WASTE MANAGEMENT, Periodic capacitated vehicle routing problem, Discrete location and assignment, Optimization and Control (math.OC), simulated annealing algorithms, https://purl.org/becyt/ford/2.11, waste management
FOS: Computer and information sciences, PERIODIC CAPACITATED VEHICLE ROUTING PROBLEM, Transportation, logistics and supply chain management, mixed integer programming, Capacitated facility location problem, genetic algorithms, periodic capacitated vehicle routing problem, CAPACITATED FACILITY LOCATION PROBLEM, Mixed integer programming, Deterministic network models in operations research, 332907 Transporte, FOS: Mathematics, Neural and Evolutionary Computing (cs.NE), https://purl.org/becyt/ford/2, Waste management, Mathematics - Optimization and Control, 120315 Heurística, GENETIC ALGORITHMS, Simulated annealing algorithms, MIXED INTEGER PROGRAMMING, capacitated facility location problem, Computer Science - Neural and Evolutionary Computing, Genetic algorithms, Approximation methods and heuristics in mathematical programming, 330807 Eliminación de residuos, WASTE MANAGEMENT, Periodic capacitated vehicle routing problem, Discrete location and assignment, Optimization and Control (math.OC), simulated annealing algorithms, https://purl.org/becyt/ford/2.11, waste management
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
