Using iterated greedy and randomized iterated greedy algorithms to solve urban area waste collection in Riyadh city

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    This paper addresses the real-life waste collection vehicle routing problem by applying Iterated Greedy (IG) and Randomized Iterated Greedy (RIG) in order to improve the processes. This kind of problem becomes more complex in developing countries in several aspects such as costs and fuel. Nowadays, the waste collection is considered as one of the interesting areas. There are three types of waste: commer-cial, residential and roll-on-roll-off. In this paper, we mainly consider the residential waste collection problem. The problem can be summa-rized as follows: a vehicle has to satisfy the demand at each customer location while satisfying the capacity of the vehicle for reducing the total cost. We report a case study that is related to waste collection in Riyadh, Kingdom of Saudi Arabia. To solve the case study problem, IG and RIG were employed. Experiments have been done on the case study data and show a better performance when compared IG algo-rithm results with RIG algorithm results.



  • Keywords

    Case Study; Iterated Greedy; Randomization; Waste Collection.

  • References

      [1] Faccio, M., Persona, A., Zanin, Giorgia. (2011). Waste collection multi objective model with real time traceability data. Waste management. Volume 31, issue 12, December 2011, pages 2391-2405.

      [2] Golden. B. L., Assad., A. A. Wasil. E. A., (2011). Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy, and newspaper industries. Published in the vehicle routing problem, pages 245-286. Society for industrial and applied mathematics Philadelphia, PA, USA, 2011. ISBN: 0-89871-498-2.

      [3] Gupte, S, K, Bhatia, R, K., Routing optimization of municipal solid waste collection in Jabalpur city using ARC GIS. (2017). International journal of trend in scientific research and development. ISSN No: 2456-6470. Volume 2. Issue 1. November- December 2017. Page 457.

      [4] Gruler, A., Juan, A. A., Fikar, C., Hirsch, P. (2015). A Simheuristic for the Waste Collection Problem with Stochastic Demands in Smart Cities. Simulation in Production and and Logistics. (2015). Markus Rabe & Uwe Clausen (eds.) Fraunhofer IRB Verlag, Stuttgart 2015.

      [5] Kim, J, D., Choi, H., Lee, D., (2007). Vehicle routing in a refuse collection system: a case study. Fifth international conference on computational science and applications.

      [6] Mat, N, A., Benjamin, A, M., Abdul-Rahman, S., and Wibowo, A, (2017). Nearest greedy for solving the waste collection vehicle routing problem: A case study. AIP conference proceedings 1905, 040018 (2017).

      [7] Moustafa, A., Abdulhalim, A, A., Eltawil, A, B., Fors. N., (2013). Waste collection vehicle routing problem: case study in Alexandria, Egypt. 19th International conference on industrial engineering and engineering management.

      [8] Rajan, L., Saji, K, S., Saraswathi, U., (2018). Solid waste management using internet of things and android application. GRD Journal/ Global research and development journal for engineering/ national conference on emerging trends in electrical, electronics and computer engineering (ETEEC-2018) April 2018. E-ISSN: 2455-5703.

      [9] Ruiz, R., Stutzle, T., (2005). An Iterated Greedy Algorithm for the Flowshop Problem with Sequence Dependent Setup Times. The 6th Metaheuristics International Conference, 817–823.

      [10] Ruiz, R., Stutzle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177, 2033–2049.




Article ID: 30660
DOI: 10.14419/ijasp.v8i1.30660

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.