English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Modified Discrete Firefly Simulated Annealing (MDF-SA) Algorithm was used to solve travelling salesman problem (TSP) using the tanh function for discretization. MDF-SA was tested on four (4) data instances from TSPLIB and the Davao City solid waste collection routing system. The objective of this study is to evaluate and compare MDF-SA with MDFA in terms of running time and solution quality. The data set selected from the TSPLIB are ST70, PR152, GR431, and TS225. The Davao City solid waste collection routing system is used in the hopes of finding a better solution from the current. Results show that MDF-SA and MDFA perform almost equally well on the data sets PR152 and GR43. MDFA performs better on using the TS225 data set, but MDF-SA performs much better on ST70. In general, the hybrid algorithm has produced better route system quality of the Davao City solid waste collection than the MDFA.

Solid Waste Collection Routing Optimization using Hybridized Modified Discrete Firefly Algorithm and Simulated Annealing - A Case Study in Davao City, Philippines