Abstract:
A Continuous Approximation Model for Vehicle Routing in Solid
Waste Management Systems
The problem of designing routes for solid waste collection systems
is analyzed in the ``house to house'' variant. Marginal costs
area,-according to route distances from depot- are determined
to propose optimal sizes of zones. A continuous approximation
approach is used to propose simple formulas to design routes
in square grid metrics with alternative senses. A methodology
is proposed with partial results applied to a real case, ``Students-City'',
whose name is maintained anonymous. The problem of inside odd
nodes within oriented networks is analyzed. Guidelines for a
generic classification of networks are given and a hypothetical
formula proposed for any type of network.