RESUMO
Municipal solid waste management is a paramount activity in modern cities due to environmental, social and economic problems that can arise when mishandled. In this work, the sequencing of micro-routes in the Argentine city of Bahía Blanca is addressed, which is modelled as a vehicle routing problem with travel time limit and the vehicle's capacity. Particularly, we propose two mathematical formulations based on mixed integer programming and we solve a set of instances of the city of Bahía Blanca based on real data. Moreover, with this model, we estimate the total distance and travel time of the waste collection and use this data to analyse the possibility of installing a transfer station. The results demonstrate the competitiveness of the approach to resolve realistic instances of the target problem and suggest the convenience of installing a transfer station in the city considering the reduction of the travelled distance.
Assuntos
Eliminação de Resíduos , Gerenciamento de Resíduos , Eliminação de Resíduos/métodos , Gerenciamento de Resíduos/métodos , Resíduos Sólidos , CidadesRESUMO
In the last decades, cities have increased the number of activities and services that depends on an efficient and reliable electricity service. In particular, households have had a sustained increase of electricity consumption to perform many residential activities. Thus, providing efficient methods to enhance the decision making processes in demand-side management is crucial for achieving a more sustainable usage of the available resources. In this line of work, this article presents an optimization model to schedule deferrable appliances in households, which simultaneously optimize two conflicting objectives: the minimization of the cost of electricity bill and the maximization of users satisfaction with the consumed energy. Since users satisfaction is based on human preferences, it is subjected to a great variability and, thus, stochastic resolution methods have to be applied to solve the proposed model. In turn, a maximum allowable power consumption value is included as constraint, to account for the maximum power contracted for each household or building. Two different algorithms are proposed: a simulation-optimization approach and a greedy heuristic. Both methods are evaluated over problem instances based on real-world data, accounting for different household types. The obtained results show the competitiveness of the proposed approach, which are able to compute different compromising solutions accounting for the trade-off between these two conflicting optimization criteria in reasonable computing times. The simulation-optimization obtains better solutions, outperforming and dominating the greedy heuristic in all considered scenarios.
Assuntos
Algoritmos , Eletricidade , Cidades , Heurística , HumanosRESUMO
The management of the collection of Municipal Solid Waste is a complex task for local governments since it consumes a large portion of their budgets. Thus, the use of computer-aided tools to support decision-making can contribute to improve the efficiency of the system and reduce the associated costs, especially in developing countries, which usually suffer from a shortage of resources. In the present work, a simulated annealing algorithm is proposed to address the problem of designing the routes of waste collection vehicles. The proposed algorithm is compared to a commercial solver based on a mixed-integer programming formulation and two other metaheuristic algorithms, i.e., a state-of-the-art large neighborhood search and a genetic algorithm. The evaluation is carried out on both a well-known benchmark from the literature and real instances of the Argentinean city of BahȪa Blanca. The proposed algorithm was able to solve all the instances, having a performance similar to the large neighborhood procedure, while the genetic algorithm showed the worst results. The simulated annealing algorithm was also able to improve the solutions of the solver in many instances of the real dataset.