عنوان مقاله [English]
نویسندگان [English]چکیده [English]
This paper presents an Algorithm to solve an urban waste collection problem by
delivering suitable route in each separate areas of Tehran in order to minimize the cost
of waste collection. We know the fuel consuming has a direct relation ship with
driving distances by collection vehicles, so, by minimize the cost of fuel consuming
because waste collection consist of 50%-70% of totally collection expenses.
Mathematical programming used to solve this problem base on integer
programming with three variables and four limits.
We propose a practical solution method which consists of three components: zoning
Algorithm, route generating Algorithm and combination Algorithm.
Zoning Algorithm: a separated area divides in to small areas which each area
consist of many big trash bins and surrounded between four streets, each points on
border could be considered as a start or end points.
Route generating Algorithm: find the smallest routes between start and end points.
Combination Algorithm: find the suitable neighborhood areas by consideration of
the collection vehicles and capacities in each area. Until to minimize the traversed
completely. Our topological limitations are: deadened streets, boulevards, traffic laws,
such as one way streets in order to become closer in the real in the real word scale.
The experimental results on real word problem, using data from 3 separate areas of
Tehran, showed the superiority of the solution generated by the porposed intelligent
Algorithm to the solution generated by human experts.