Exact and heuristic approaches for multi-objective garbage accumulation points location in real scenarios

• URL: http://arxiv.org/abs/2103.04826v1
• Date: Fri, 5 Mar 2021 13:47:21 GMT
• Title: Exact and heuristic approaches for multi-objective garbage accumulation points location in real scenarios
• Abstract summary: This article contributes with an exact multiobjective approach to solve the waste bin location in which the optimization criteria are considered. The experimental evaluation was performed on real-world scenarios of the cities of Montevideo, Uruguay, and Bah'ia Blanca, Argentina.
• Score: 0.7646713951724011
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Municipal solid waste management is a major challenge for nowadays urban societies, because it accounts for a large proportion of public budget and, when mishandled, it can lead to environmental and social problems. This work focuses on the problem of locating waste bins in an urban area, which is considered to have a strong influence in the overall efficiency of the reverse logistic chain. This article contributes with an exact multiobjective approach to solve the waste bin location in which the optimization criteria that are considered are: the accessibility to the system (as quality of service measure), the investment cost, and the required frequency of waste removal from the bins (as a proxy of the posterior routing costs). In this approach, different methods to obtain the objectives ideal and nadir values over the Pareto front are proposed and compared. Then, a family of heuristic methods based on the PageRank algorithm is proposed which aims to optimize the accessibility to the system, the amount of collected waste and the installation cost. The experimental evaluation was performed on real-world scenarios of the cities of Montevideo, Uruguay, and Bah\'ia Blanca, Argentina. The obtained results show the competitiveness of the proposed approaches for constructing a set of candidate solutions that considers the different trade-offs between the optimization criteria.

Related papers

• Pandora's AI Model Routing Box: Efficient Allocation with Costly Value Estimation [64.51088225051959]
  Heterogeneous AI systems can improve quality and efficiency by routing queries to the specialist who can answer most effectively at the lowest cost.<n>We formalize this tradeoff as an instance of Pandora's Box, the classical problem of optimal search with costly inspection.<n>Under a Gaussian signal model, the resulting policies have closed-form value-of-information expressions that determine, for each specialist and input, whether refining the value estimate is worth its cost.
  arXiv  Detail & Related papers  (2026-08-20T17:54:37Z)
• MDWD: A Street-Level Dataset for Municipal Solid Waste Detection in Dense Urban Environments [0.23332469289621785]
  This paper introduces the Maltese Domestic Waste dataset (MDWD)<n>MDWD is a street-level benchmark comprising 3,697 high-resolution images and 11,461 manually annotated instances.<n>Results indicate MDWD supports effective training across both compact real-time detectors and transformer-based models.
  arXiv  Detail & Related papers  (2026-07-31T19:54:25Z)
• Efficient Waste Sorting for Circular Economy: A Confidence-guided comparison between One-Vs-All and One-Vs-Rest Classification Strategies with Human-in-the-Loop for Automated Waste Sorting [1.6583003147024218]
  The research uses a dataset constructed in alignment with the waste categories and sorting scheme of the city of Goslar in Germany.<n>It aims to extend beyond the overall performance by examining the behavior of OvA and OvR classification strategies in identifying samples likely to be misclassified.
  arXiv  Detail & Related papers  (2026-07-02T14:29:45Z)
• Chain of Uncertain Rewards with Large Language Models for Reinforcement Learning [52.48243762705385]
  Chain of Uncertain Rewards (CoUR) is a novel framework that integrates large language models (LLMs) to streamline reward function design and evaluation.<n>We show that CoUR achieves better performance and significantly lowers the cost of reward evaluations.
  arXiv  Detail & Related papers  (2026-04-15T05:44:14Z)
• Optimizing Shanghai's Household Waste Recycling Collection Program by Decision-Making based on Mathematical Modeling [2.710486998959315]
  We will show a vivid and comprehensive application of the classical mathematical multi-criteria decision model: Analytical Hierarchy Process.<n>We will also seek the key criteria for the sustainability development of human society, by assessing the important elements of waste recycling.
  arXiv  Detail & Related papers  (2025-07-05T00:13:52Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection [0.0]
  This article proposes a unified optimization model to address two common waste management system optimization problems. 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 a genetic algorithm (GA) are provided to solve this proposed unified optimization model.
  arXiv  Detail & Related papers  (2025-04-14T19:01:12Z)
• Evolutionary Greedy Algorithm for Optimal Sensor Placement Problem in Urban Sewage Surveillance [6.133464220178637]
  We propose a novel evolutionary greedy algorithm (EG) to enable efficient and effective optimization for large-scale directed networks. The proposed model is evaluated on both small-scale synthetic networks and a large-scale, real-world sewage network in Hong Kong.
  arXiv  Detail & Related papers  (2024-09-25T09:27:51Z)
• Illuminating the Diversity-Fitness Trade-Off in Black-Box Optimization [9.838618121102053]
  In real-world applications, users often favor structurally diverse design choices over one high-quality solution. This paper presents a fresh perspective on this challenge by considering the problem of identifying a fixed number of solutions with a pairwise distance above a specified threshold.
  arXiv  Detail & Related papers  (2024-08-29T09:55:55Z)
• A Multi-population Integrated Approach for Capacitated Location Routing [14.897794986447474]
  This paper presents a multi-population integrated framework for the capacitated location-routing problem. It includes an effective neighborhood-based local search, a feasibility-restoring procedure and a diversification-oriented mutation. Experiments on 281 benchmark instances from the literature show that the algorithm performs remarkably well.
  arXiv  Detail & Related papers  (2024-03-14T13:11:30Z)
• Learning-assisted Stochastic Capacity Expansion Planning: A Bayesian Optimization Approach [3.124884279860061]
  Large-scale capacity expansion problems (CEPs) are central to costeffective decarbonization of regional energy systems. Here, we propose a learning-assisted approximate solution method to tractably solve two-stage CEPs. We show that our approach yields an estimated cost savings of up to 3.8% in comparison to series aggregation approaches.
  arXiv  Detail & Related papers  (2024-01-19T01:40:58Z)
• Consistency-Aware Anchor Pyramid Network for Crowd Localization [167.93943981468348]
  Crowd localization aims to predict the spatial position of humans in a crowd scenario. We propose an anchor pyramid scheme to adaptively determine the anchor density in each image region.
  arXiv  Detail & Related papers  (2022-12-08T04:32:01Z)
• A Data-driven Pricing Scheme for Optimal Routing through Artificial Currencies [1.3419982985275638]
  Mobility systems often suffer from a high price of anarchy due to the uncontrolled behavior of selfish users. This paper presents a data-driven approach to automatically adapt artificial-currency tolls within repetitive-game settings.
  arXiv  Detail & Related papers  (2022-11-27T11:23:29Z)
• IoT-based Route Recommendation for an Intelligent Waste Management System [61.04795047897888]
  This work proposes an intelligent approach to route recommendation in an IoT-enabled waste management system given spatial constraints. Our solution is based on a multiple-level decision-making process in which bins' status and coordinates are taken into account.
  arXiv  Detail & Related papers  (2022-01-01T12:36:22Z)
• IS-COUNT: Large-scale Object Counting from Satellite Images with Covariate-based Importance Sampling [90.97859312029615]
  We propose an approach to estimate object count statistics over large geographies through sampling. We show empirically that the proposed framework achieves strong performance on estimating the number of buildings in the United States and Africa, cars in Kenya, brick kilns in Bangladesh, and swimming pools in the U.S.
  arXiv  Detail & Related papers  (2021-12-16T18:59:29Z)
• Regret-Optimal Filtering [57.51328978669528]
  We consider the problem of filtering in linear state-space models through the lens of regret optimization. We formulate a novel criterion for filter design based on the concept of regret between the estimation error energy of a clairvoyant estimator. We show that the regret-optimal estimator can be easily implemented by solving three Riccati equations and a single Lyapunov equation.
  arXiv  Detail & Related papers  (2021-01-25T19:06:52Z)
• Optimal Off-Policy Evaluation from Multiple Logging Policies [77.62012545592233]
  We study off-policy evaluation from multiple logging policies, each generating a dataset of fixed size, i.e., stratified sampling. We find the OPE estimator for multiple loggers with minimum variance for any instance, i.e., the efficient one.
  arXiv  Detail & Related papers  (2020-10-21T13:43:48Z)
• Hierarchical Adaptive Contextual Bandits for Resource Constraint based Recommendation [49.69139684065241]
  Contextual multi-armed bandit (MAB) achieves cutting-edge performance on a variety of problems. In this paper, we propose a hierarchical adaptive contextual bandit method (HATCH) to conduct the policy learning of contextual bandits with a budget constraint.
  arXiv  Detail & Related papers  (2020-04-02T17:04:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.