Optimization of the waste collection arc routing problem using the physics-based electromagnetism-like algorithm

Clicks: 2
ID: 287255
2022
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #1,651 of 3,757 articles by views in Malay Journal

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 3,757 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Waste collection is considered as a first objective in planning a sustainable waste management, and provision of substantial collection coverage in urban and rural areas should be satisfied before investing in more sophisticated infrastructure. Therefore, good waste collection service is essential to upgrade further the next levels of a municipal solid waste system. One of the ways to enhance performance on waste collection is to plan effective routing of trucks. The study formulated a Time-Dependent Capacitated Arc Routing Problem with Green Routing (TD- CARP-GR) to model the waste collection routing problem of Parang, Marikina City using three scenarios: baseline, parameter, and collection scenarios. This study focused on the door-to- door method of waste collection and its transport to a Materials Recovery Facility (MRF) in Parang, Marikina City. The objective is to build an optimization problem of waste collection and minimize the distance taken by the truck with their corresponding GHG emissions and fuel consumption. A physics-based algorithm called Electromagnetism-like (EM-Like) is used for the solution process and is executed on a directed, multigraph-based representation of the road network, where edges contain the demand points and nodes will be the intersections and dead- ends. The simulation results revealed that the particle movement boundary and the initialization phase where feasible solutions are generated to start the algorithm, affects the search process. Moreover, using Lilliefors, Kruskal-Wallis, and post-hoc test Tukey-Kramer, the particles were observed to achieve diversity and cooperation in the task to minimize the obtained distance values. The Shannon Entropy measure also quantified the amount of information contained during the search when two parameter scenarios are compared and showed that the traditional formulation of particle movement in [0,1] obtained better search quality. However, the algorithm suffers from slow convergence rate of solutions, as seen from the huge difference between the randomly generated initial solutions and city-block based initialization of which the latter encourages more intelligent way of permuting objects as it tends to order streets that are closer to each other. Therefore, more iterations are needed leading to higher computational expense to eventually reach the range of values generated from the better initialization method implemented in the city-block based distance. Moreover, subjecting the algorithm with a local search procedure significantly improved the obtained values per iteration, with the highest improvement of 21 percent. This trend is evident to all the parameter scenarios. The study also strengthens the recommendation of the implementation of
Reference Key
persistent_1760661042_68f18e32f2652 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Jao, Jazzie R.
Journal Malay Journal
Year 2022
DOI
DOI not found
URL
https://animorepository.dlsu.edu.ph/etdm_physics/8
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.