Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{164984,
        author = {1SHRUTIJA VIJAY MESHRAM and AKASH INGOLE,  and RAJESH INGOLE},
        title = {OPTIMIZATION TECHNIQUES FOR E-WASTE COLLECTION SYSTEM},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {11},
        number = {1},
        pages = {1-7},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=164984},
        abstract = {Electronic waste (e-waste) is one of the most talked about issues in the world today due to its potential to reduce environmental hazards and pollution. In this study, material flow analysis (MFA) and site-specific validation have been applied to estimate the theoretical waste arising for each item in the study area. The results obtained from this analysis have been compared with the assumptions to validate the average life of the electronic item assumed in the sensitivity analysis. The study shows that improper management of electronic waste can have significant negative impacts on the environment and human health. The exponential growth in electronic waste (e-waste) presents significant environmental and health challenges globally. Traditional waste management practices are insufficient to handle the complex and hazardous nature of e-waste, necessitating an innovative and sustainable approach. This paper proposes an advanced e-waste collection system designed to enhance the efficiency, effectiveness, and environmental sustainability of e-waste management.},
        keywords = {E-Waste, Electronic Waste, Sustainable Waste Management, Collection System, Environmental Sustainability, Public Awareness, Recycling, Hazardous Waste Electronic Waste, E-Waste Pollution, E-Waste Management.},
        month = {},
        }