IDEAS home Printed from https://ideas.repec.org/a/ibn/ijspjl/v9y2020i3p66.html
   My bibliography  Save this article

Combined Nearest Greedy Algorithm With Randomized Iterated Greedy Algorithm to Solve Waste Collection Problem

Author

Listed:
  • Abdulwahab Almutairi

Abstract

The waste collection considers as one of the common transportation problems in the operation research and management area and also it is a significant activity in each city. In this kind of the paper, we study a version of a real-life waste collection and try to find an efficient way to reduce the costs such as the cost of the operation such as fuel and maintenances, the cost of the environment such as noise and traffic congestions, the cost of the investment such as vehicles fleet. The waste collection problem can be formulated as a well-known Vehicle Routing Problem (VRP). The basic idea is to attempt to develop a daily truck routing which will improve the efficiency of the vehicle distribution in Riyadh. The solution will be done in a good way that it can serve all the customers, while in the meantime, it will attempt to improve the total cost. The main contribution of this paper is to improve the solution of total costs for the waste collection while using the existing resources through the combination of the Nearest Greedy algorithm with both Iterated Greedy (IG) and Randomized Iterated Greedy (RIG). We execute our proposed method with real data that collect waste from more than 100 customers in Riyadh city. In terms of the experiments, the results received by those methods are successfully implemented and improved the overall waste collection in Riyadh. In conclusion, these algorithms able to reduce the total costs to this kind of case study with the same number of vehicles.

Suggested Citation

  • Abdulwahab Almutairi, 2020. "Combined Nearest Greedy Algorithm With Randomized Iterated Greedy Algorithm to Solve Waste Collection Problem," International Journal of Statistics and Probability, Canadian Center of Science and Education, vol. 9(3), pages 1-66, May.
    • Handle: RePEc:ibn:ijspjl:v:9:y:2020:i:3:p:66
    as

    Download full text from publisher

    File URL: http://www.ccsenet.org/journal/index.php/ijsp/article/download/0/0/42581/44487
    Download Restriction: no
    File URL: http://www.ccsenet.org/journal/index.php/ijsp/article/view/0/42581
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    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. Zaid M. Aldhafeeri & Hatem Alhazmi, 2022. "Sustainability Assessment of Municipal Solid Waste in Riyadh, Saudi Arabia, in the Framework of Circular Economy Transition," Sustainability, MDPI, vol. 14(9), pages 1-18, April.

    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. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.
    2. Kuo-Ching Ying & Yi-Ju Tsai, 2017. "Minimising total cost for training and assigning multiskilled workers in production systems," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2978-2989, May.
    3. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    4. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    5. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    6. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    7. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.
    8. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    9. Gang Xuan & Win-Chin Lin & Shuenn-Ren Cheng & Wei-Lun Shen & Po-An Pan & Chih-Ling Kuo & Chin-Chia Wu, 2022. "A Robust Single-Machine Scheduling Problem with Two Job Parameter Scenarios," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
    10. Fatemeh Sabouhi & Ali Bozorgi-Amiri & Mohammad Moshref-Javadi & Mehdi Heydari, 2019. "An integrated routing and scheduling model for evacuation and commodity distribution in large-scale disaster relief operations: a case study," Annals of Operations Research, Springer, vol. 283(1), pages 643-677, December.
    11. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2018. "A new methodology for the open-pit mine production scheduling problem," Omega, Elsevier, vol. 81(C), pages 169-182.
    12. Gnägi, M. & Strub, O., 2020. "Tracking and outperforming large stock-market indices," Omega, Elsevier, vol. 90(C).
    13. Alfaro-Fernández, Pedro & Ruiz, Rubén & Pagnozzi, Federico & Stützle, Thomas, 2020. "Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 282(3), pages 835-845.
    14. Zhou, Hong & Cheung, Waiman & Leung, Lawrence C., 2009. "Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm," European Journal of Operational Research, Elsevier, vol. 194(3), pages 637-649, May.
    15. Hatami, Sara & Ruiz, Rubén & Andrés-Romano, Carlos, 2015. "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 169(C), pages 76-88.
    16. Libralesso, Luc & Focke, Pablo Andres & Secardin, Aurélien & Jost, Vincent, 2022. "Iterative beam search algorithms for the permutation flowshop," European Journal of Operational Research, Elsevier, vol. 301(1), pages 217-234.
    17. Julio C. Londoño & Rafael D. Tordecilla & Leandro do C. Martins & Angel A. Juan, 2021. "A biased-randomized iterated local search for the vehicle routing problem with optional backhauls," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 387-416, July.
    18. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    19. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
    20. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    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:ibn:ijspjl:v:9:y:2020:i:3:p:66. 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: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    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.