Development Of A Simplified Procedure
For Routeing Solid Waste Collection.
Dr.Dr. Adel Awad (1) M. T. Aboul-Ela (2) R. abou-hassan(3)
(1)department of environmental engg, Teshreen University,
Lattakia, Syria.
(2) department of environmental engg,Almenia University, Egypt.
(3)Dept. of Civil Engng, Jordan University of Science, Technology,Irbid, Jordan.
Abstract
Solid waste management is concerned with the control of generation, storage, collection, transportation, processing and disposal of waste according to the principles of public health, economics and other environmental considerations. The routeing
Problem is one of the main components of solid waste management. The objective of this paper is to suggest a suitable routeing system for the city of irbid.
Two basic approaches are normally applied to vehicle routeing:
The Chinese postman problem(arc routeing) which finds the minimum distance of a continuous tour through a network that travels all arcs and cannot be applied to the case of solid waste collection in irbid.
The traveling salesman(node routeing) which requires that a visit must be made to a number of specific points (pick-up) and the routeing problem is solved as a node covering one.
The traveling salesman system was found to be the most suitable approach that can be applied to the solid waste collection in irbid.
Several techniques mainly based on computers and mathematical programming (such as Monte Carlo simulation, heuristic algorithm and modified heuristic algorithm) were implemented for solving the traveling salesman problem in the eastern region of irbid. The results of this paper indicate that the use of modified heuristic algorithm is best suited for this problem due to its simplicity and practical application.
|
