Universiti Teknologi Malaysia Institutional Repository

Ant colony optimization for solving solid waste collection scheduling problems

Ismail, Zuhaimy and Loh, S. L. (2009) Ant colony optimization for solving solid waste collection scheduling problems. Journal of Mathematics and Statistics, 5 (3). pp. 199-205. ISSN 1549-3644

[img] PDF - Published Version
Restricted to Repository staff only

208Kb

Official URL: http://www.scipub.org/fulltext/jms2/jms253199-205....

Abstract

Southern Waste Management environment (SWM environment) is a company responsible for the collection and disposal of solid waste for the city of Johor Bahru, a city with over one million populations. The company is implementing an integrated solid waste management system where it involved in the optimization of resources to ensure the effectiveness of its services. Formulating this real life problem into vehicle routing problem with stochastic demand model and using some designed algorithms to minimize operation cost of solid waste management. Approach: The implementation of Ant Colony Optimization (ACO) for solving solid waste collection problem as a VRPSD model was described. A set of data modified from the well known 50 customers problems were used to find the route such that the expected traveling cost was minimized. The total cost was minimized by adopting a preventive restocking policy which was trading off the extra cost of returning to depot after a stock-out with the cost of returning depot for restocking before a stock-out actually occurs. For comparison purposes, Simulated Annealing (SA) was used to generate the solution under the same condition. Results: For the problem size with 12 customers with vehicle capacity 10 units, both algorithms obtained the same best cost which is 69.4358 units. But the percentage deviations of averages from the associated best cost are 0.1322 and 0.7064 for ACS and SA. The results indicated that for all demand ranges, proposed ACO algorithm showed better performance than SA algorithm. Conclusion: SA was able to obtain good solutions for small ranges especially small size of problem. For ACS, it is always provide good results for all tested ranges and problems sizes of the tested problem

Item Type:Article
Uncontrolled Keywords:Ant colony optimization, VRP, VRPSD, solid waste collection problems
Subjects:Q Science > QA Mathematics
Divisions:Science
ID Code:860
Deposited By: Ms Zalinda Shuratman
Deposited On:22 Feb 2007 06:55
Last Modified:13 Oct 2010 04:28

Repository Staff Only: item control page