1 / 17

Application of a software tool for routing optimisation in the Azemmour area

This paper presents the application of the "Container Collector" software tool for optimizing the collection and transfer of Municipal Solid Waste (MSW) in the municipality of Azemmour. The software generates optimum vehicle routes, minimizing costs and total distance traveled.

vasquezr
Download Presentation

Application of a software tool for routing optimisation in the Azemmour area

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. International Conference on Sustainable Solid Waste Management (SSWM -09) Application of a software tool for routing optimisation in the Azemmour area D. Malamis, M. Loizidou, M. Mountadar, M. Rihani et O. Assobhei Friday 19 June 2009

  2. Introduction • The municipality Azemmour • population 40.000 • 30tn of MSW/day, • 0.75kg of MSW/capita/day • The collection and transfer of the Municipal Solid Waste (MSW) is a Vehicle Routing Problem (VRP) • Presentation of a software tool – “Container Collector” -that optimizes the collection and transfer of MSW in the municipality of Azemmour

  3. Importance of VRPs Produce routes that contribute to the reduction of: • cost, by offering simultaneously significant savings in all related expenses (capital and maintenance cost, fuel cost, personnel cost) • potential environmental impacts (e.g. air emissions from vehicles)

  4. “Container Collector” software • designed, implemented and deployed under the platform of MS Windows XP • solving the Vehicle Routing Problem in the case of urban waste container collection • automatically generates optimum vehicle routes (which vehicles should deliver to which customers and in which order) minimizing simultaneously • the vehicle costs and • the total distance traveled by the vehicles

  5. Constrains are set through equations • minimization of the vehicle costs and the total distance covered by the vehicles • each container is serviced by exactly one vehicle • ensuring the route continuity – means that a vehicle arriving at a customer must also leave this customer • each vehicle must not service more than its capacity in each route • maximum route length or duration • each vehicle is used exactly once

  6. Azemmour municipality road network • A snapshot of the application main document window • Spatial reproduction of application data on an appropriate road network

  7. Basic Application Navigation The basic application view is navigated through a set of button controls that is given below. Arrow Tool. Depicts road names. Zoom in & out Tools. They have a typical GIS zooming in & out tool function Pan Tool. It has a typical GIS pan tool function Restore Tool. Restores original map

  8. Presentation of MSW containers in graphical mode on the application screen MSW containers distribution in Azemmour municipality 69 bins in total at the main road network Starting & Ending point of the vehicles route

  9. Presentation of the basic problem parameters dialog

  10. Solving the Vehicle Routing Problem

  11. Presentation of all routes and containers in graphical mode (total and each one route) • Software Results • 4 trucks for the collection of bins • 4 different routes 1st route 2nd route 3rd route 4th route

  12. Presentation of each truck route separately – 1st Route and containers involved Which truck? 1st Truck Which route should the truck follow? How many bins did the truck collect? 20 containers How much time does the truck need for the collection of the bins? 2hr and 24 min

  13. Presentation of each truck route separately – 2nd Route and containers involved 2nd Truck Which route should the truck take? 18 containers in 1hour and 51min

  14. Presentation of each truck route separately – 3rd Route and containers involved 3rd Truck Which route should the truck take? 19 containers in 2hrs and 21min

  15. Presentation of each truck route separately – 4th Route and containers involved Which truck? 4th Truck Which route should the truck take? 12 containers 1hr and 26min

  16. Conclusions • Design and implementation of a Vehicle Routing Problem (VRP) software for the optimization of MSW collection and transfer for the case of Azemmour municipality • Minimizes the total distance traveled, • Minimizes the total length of tours • Minimizes costs (wages, fuel consumption etc) • Possible to determine optimal routes by simply setting the appropriate parameters • the maximum number of containers per truck • the mean speed of the vehicles/trucks • the shift period • the container service time • Illustrates graphically and in tubular mode the routing information needed • Number of routes and trucks needed • The route that each trucks should take • The total containers that each truck should collect and transfer as well as the as associated time

  17. Thank You

More Related