IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v13y2021i16p8896-d611039.html
   My bibliography  Save this article

Extended Maximal Covering Location and Vehicle Routing Problems in Designing Smartphone Waste Collection Channels: A Case Study of Yogyakarta Province, Indonesia

Author

Listed:
  • Diana Puspita Sari

    (Department of Mechanical and Industrial Engineering, Universitas Gadjah Mada, Yogyakarta 55281, Indonesia
    Department of Industrial Engineering, Diponegoro University, Semarang 50275, Indonesia)

  • Nur Aini Masruroh

    (Department of Mechanical and Industrial Engineering, Universitas Gadjah Mada, Yogyakarta 55281, Indonesia)

  • Anna Maria Sri Asih

    (Department of Mechanical and Industrial Engineering, Universitas Gadjah Mada, Yogyakarta 55281, Indonesia)

Abstract

Most people will store smartphone waste or give it to others; this is due to inadequate waste collection facilities in all cities/regencies in Indonesia. In Yogyakarta Province, there is no electronic waste collection facility. Therefore, an e-waste collection network is needed to cover all potential e-waste in the province of Yogyakarta. This study aims to design a collection network to provide easy access to facilities for smartphone users, which includes the number and location of each collection center and the route of transporting smartphone waste to the final disposal site. We proposed an extended maximal covering location problem to determine the number and location of collection centers. Nearest neighbor and tabu search are used in forming transportation routes. The nearest neighbor is used for initial solution search, and tabu search is used for final solution search. The study results indicate that to facilitate all potential smartphone waste with a maximum distance of 11.2 km, the number of collection centers that must be established is 30 units with three pick-up routes. This research is the starting point of the smartphone waste management process, with further study needed for sorting, recycling, repairing, or remanufacturing after the waste has been collected.

Suggested Citation

  • Diana Puspita Sari & Nur Aini Masruroh & Anna Maria Sri Asih, 2021. "Extended Maximal Covering Location and Vehicle Routing Problems in Designing Smartphone Waste Collection Channels: A Case Study of Yogyakarta Province, Indonesia," Sustainability, MDPI, vol. 13(16), pages 1-23, August.
    • Handle: RePEc:gam:jsusta:v:13:y:2021:i:16:p:8896-:d:611039
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/13/16/8896/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/13/16/8896/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Murali, Pavankumar & Ordóñez, Fernando & Dessouky, Maged M., 2012. "Facility location under demand uncertainty: Response to a large-scale bio-terror attack," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 78-87.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    3. Vatsa, Amit Kumar & Jayaswal, Sachin, 2016. "A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty," European Journal of Operational Research, Elsevier, vol. 251(2), pages 404-418.
    4. Richard L. Church & Rhonda R. Davis, 1992. "The Fixed Charge Maximal Covering Location Problem," Papers in Regional Science, Wiley Blackwell, vol. 71(3), pages 199-215, July.
    5. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
    6. Abdul Salam Khan & Qazi Salman Khalid & Khawar Naeem & Rafiq Ahmad & Razaullah Khan & Waqas Saleem & Catalin Iulian Pruncu, 2021. "Application of Exact and Multi-Heuristic Approaches to a Sustainable Closed Loop Supply Chain Network Design," Sustainability, MDPI, vol. 13(5), pages 1-25, February.
    7. Arana-Jiménez, Manuel & Blanco, Víctor & Fernández, Elena, 2020. "On the fuzzy maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 283(2), pages 692-705.
    8. Gmira, Maha & Gendreau, Michel & Lodi, Andrea & Potvin, Jean-Yves, 2021. "Tabu search for the time-dependent vehicle routing problem with time windows on a road network," European Journal of Operational Research, Elsevier, vol. 288(1), pages 129-140.
    9. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    10. Cordeau, Jean-François & Furini, Fabio & Ljubić, Ivana, 2019. "Benders decomposition for very large scale partial set covering and maximal covering location problems," European Journal of Operational Research, Elsevier, vol. 275(3), pages 882-896.
    11. Ibarra-Rojas, O.J. & Ozuna, L. & López-Piñón, D., 2020. "The maximal covering location problem with accessibility indicators," Socio-Economic Planning Sciences, Elsevier, vol. 71(C).
    12. Diana Puspita Sari & Nur Aini Masruroh & Anna Maria Sri Asih, 2021. "Consumer Intention to Participate in E-Waste Collection Programs: A Study of Smartphone Waste in Indonesia," Sustainability, MDPI, vol. 13(5), pages 1-28, March.
    13. Yangkun Xia & Zhuo Fu & Lijun Pan & Fenghua Duan, 2018. "Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-19, May.
    14. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    15. Letizia Tebaldi & Teresa Murino & Eleonora Bottani, 2020. "An Adapted Version of the Water Wave Optimization Algorithm for the Capacitated Vehicle Routing Problem with Time Windows with Application to a Real Case Using Probe Data," Sustainability, MDPI, vol. 12(9), pages 1-13, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hilal Shams & Altaf Hossain Molla & Mohd Nizam Ab Rahman & Hawa Hishamuddin & Zambri Harun & Nallapaneni Manoj Kumar, 2023. "Exploring Industry-Specific Research Themes on E-Waste: A Literature Review," Sustainability, MDPI, vol. 15(16), pages 1-22, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    2. İlker Küçükoğlu & Nursel Öztürk, 2019. "A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking," Journal of Intelligent Manufacturing, Springer, vol. 30(8), pages 2927-2943, December.
    3. Min-Xia Zhang & Hong-Fan Yan & Jia-Yu Wu & Yu-Jun Zheng, 2020. "Quarantine Vehicle Scheduling for Transferring High-Risk Individuals in Epidemic Areas," IJERPH, MDPI, vol. 17(7), pages 1-17, March.
    4. Dingding Qi & Yingjun Zhao & Zhengjun Wang & Wei Wang & Li Pi & Longyue Li, 2024. "Joint Approach for Vehicle Routing Problems Based on Genetic Algorithm and Graph Convolutional Network," Mathematics, MDPI, vol. 12(19), pages 1-18, October.
    5. Shao, Saijun & Xu, Su Xiu & Huang, George Q., 2020. "Variable neighborhood search and tabu search for auction-based waste collection synchronization," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 1-20.
    6. Qi Yao & Shenjun Zhu & Yanhui Li, 2022. "Green Vehicle-Routing Problem of Fresh Agricultural Products Considering Carbon Emission," IJERPH, MDPI, vol. 19(14), pages 1-17, July.
    7. Alarcon Ortega, Emilio J. & Schilde, Michael & Doerner, Karl F., 2020. "Matheuristic search techniques for the consistent inventory routing problem with time windows and split deliveries," Operations Research Perspectives, Elsevier, vol. 7(C).
    8. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    9. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    10. Tingxin Wen & Haoting Meng, 2025. "Time-Dependent Multi-Center Semi-Open Heterogeneous Fleet Path Optimization and Charging Strategy," Mathematics, MDPI, vol. 13(7), pages 1-27, March.
    11. Anuj Mehrotra & Joseph Shantz & Michael A. Trick, 2005. "Determining newspaper marketing zones using contiguous clustering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 82-92, February.
    12. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    13. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    14. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    15. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    16. Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
    17. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    18. Zhiping Zuo & Yanhui Li & Jing Fu & Jianlin Wu, 2019. "Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints," Mathematics, MDPI, vol. 7(7), pages 1-18, July.
    19. Jinil Han & Chungmok Lee & Sungsoo Park, 2014. "A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times," Transportation Science, INFORMS, vol. 48(3), pages 373-390, August.
    20. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:13:y:2021:i:16:p:8896-:d:611039. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.