search
for
 About Bioline  All Journals  Testimonials  Membership  News  Donations


Journal of Applied Sciences and Environmental Management
World Bank assisted National Agricultural Research Project (NARP) - University of Port Harcourt
ISSN: 1119-8362
Vol. 13, Num. 2, 2009, pp. 37-40

Journal of Applied Sciences & Environmental Management, Vol. 13, No. 2, June, 2009, pp. 37-40

Route optimization for solid waste collection: Onitsha (Nigeria) case study 

Ogwueleka, T.C.

Department of Civil Engineering, University of Abuja, Nigeria Ogwueleka@yahoo.co.uk

Code Number: ja09020

ABSTRACT

Routing of solid waste collection vehicles in developing countries poses a challenging task. New decision procedure for solid waste collection problem was introduced in this study. The problem objective was to minimize the overall cost, which was essentially based on the distance travelled by vehicle. The study proposed heuristic method to generate feasible solution to an extended Capacitated Arc Routing Problem (CARP) on undirected network, inspired by the refuse collection problems in Nigeria. The heuristic procedure consists of route first, cluster second method. The computational experience with the heuristic in Onitsha was presented. The technique was compared with the existing schedule with respect to cost, time and distance travelled. The adoption of the proposed heuristic in Onitsha resulted in reduction of the number of existing vehicles, a 22.86% saving in refuse collection cost and 16.31% reduction in vehicle distance travelled per day. The result revealed a good performance of the proposed heuristic method, which would be useful in vehicle scheduling. @ JASEM

Solid waste collection is one of the most difficult operational problems faced by most cities in Nigeria. In most Nigerian cities, solid waste collections are done in an adhoc manner, which contributes to high solid waste collection cost. Solid waste collection vehicles are assigned to zones without any serious demand analysis, route construction being left to the drivers. Every time the vehicle is filled up, it heads to the disposal site to unload and then returns to the zones. This method contributes to high solid waste collection cost.

This research stems from the need to address the solid waste collection truck routing problem for urban areas. Emphasis is placed on minimizing the cost of solid waste collection through collection route optimisation since nearly 77- 95% of the solid waste budget is spent on collection and haulage in developing cities (Ogwueleka, 2003; Agunwamba et al, 1998). Operations research techniques concentrating on the vehicle routing and scheduling of a fleet are applied to address the management concerns.

Some methods have already been advanced for improving solid waste management system. Prominent among these methods include vehicle routing and optimisation of solid waste collection routes (Chang and Wei, 2002; Mourăo and Almeida, 2000) etc. Nevertheless, the number of papers that have reported studies on scheduling and routing of solid waste collection vehicles as a method of minimizing solid waste collection cost are surprisingly low. Wang et al, (1996) proposed a model where waste collection, recycling and disposal are explicitly considered, but route design problem is solved only considering the districts as the sources of demand, without analysing collection routes inside each of the zones. Agunwamba et al, (2003) have chosen to associate the demand to a set of points representing a set of streets, instead of considering in details the arcs of the network. Solid waste is collected from different sanitation zones, transported to some transition stations, and finally to a landfill. The model developed can be used to assess the convenience of setting up a new transition station and to determine the way to transport waste. Most of these works have considered waste collection problem at a district level.   

None of the above literatures took into account the road network detail in finding solution to waste collection problem. This study optimized distance travelled for an undirected capacitated arc routing problem, inspired by the refuse collection problems in Onitsha. The study’s main objective was to minimise the collection cost and distance travelled by collection vehicles.

Solid waste management in Onitsha

Onitsha is located on the bank of River Niger in Anambra State of Nigeria. It lies on latitude 6091 North and longitude 60491 East of the Greenwich meridian. Onitsha with a population of 509, 500 (Census, 2006) people cover 13,249 hectares of land area. Management of solid waste in Onitsha is the sole responsibility of Anambra State Environmental Protection Agency (ANSEPA). The solid waste generation rate is 0.54 kg per capita per day (Agunwamba et al, 1998). Onitsha Municipality is subdivided into six zones: Okpoko, Fegge, Housing Estate, Upper Iweka, Inland and GRA.

GRA is a residential district with few businesses. The algorithm was applied to GRA, a district in Onitsha, whose urbanistic structure is similar to that of the whole town. The solid waste daily production is 66 m3/day about 10.59% of the whole town’s daily production. Presently, ANSEPA has adopted hauled container system (HSC) and stationary container system (SCS).

A very interesting result for real world problems lies in the fact that the vehicles carry excess of 5 – 10% of their full capacity in the majority of trips. The total route length in GRA is 26.53 km. The collection vehicle crew is one driver and four labourers and operate 8 hours per day with maximum of two collection trips per day. There is no transfer station in Onitsha. Recycling technologies are new in the town but not common. ANSEPA at the outset performs collection services 5 days in a week. Monday to Friday (8.00 am - 4.00 pm). Solid waste collected is taken directly from the collection areas to the disposal site at the landfill located 10 km North East of Onitsha on the road to Nkwelle Ezunaka without treatment.                               

MATERIAL AND METHOD

Data were collected from both primary and secondary sources. Some tools of participatory appraisal techniques namely semi-structured interview schedule and focus group discussion were employed in data collection. The location of the disposal sites and collection points, serviceable streets, collection routes, vehicle speed, collection duration and frequency, number of trips per day, number and capacities of available vehicles, round trip duration, were collected.. The reliability of these data was checked by joining some of the trips and by observing same activities within the garage and outside. The traffic volume, street width, direction of traffic flow, characteristics of each street was obtained from observation and measurement. The distance was obtained by computing the Euclidean (or taxicab) distance between each pair of the nodes.

The road network of GRA, Onitsha is presented in Figure 1. The nodes were numbered for identification and each street was uniquely defined by a pair of nodes. The vehicle travelled at a speed of about 50 km/h in the town, thus the travel time was presumed proportional to the travel distance. Inspection of overtime, incentive time, vehicle capacity utilization, distance travelled, productive time and quantity of refuse handled yielded data from which cost and efficiency analyses were made.

Residential refuse collection requires services at a large number of discrete points. These points are close together and distributed along the arcs. Algorithms for solid waste route are considered to belong to Capacitated Arc Routing Problems (CARP) (Amponsah, 2003).  The Capacitated Arc Routing Problems (CARP) arises when arc has associated with it a positive demand and the vehicles to be routed have a finite capacity (Greistorter, 1994). One truck may not be able to service all the roads in a district due to its limited capacity. The CARP is to find a set of routes from a single depot that service all arcs in the network at minimal cost and subject to the constraints that the total demand on each route does not exceed the capacity of the vehicle. The cost of a trip comprises the cost of its serviced arcs and of its intermediate connecting paths. Demands are usually amount of waste to be collected along the streets (urban waste). The techniques combined computer and heuristics approaches. The study took into account the road network detail in finding solution to waste collection problem in undirected network.

The program was written in Visual. Basic.net and designed to run on a PC. The code ran on a PC with Centrino Duo 1 GHz with 1 Gbytes RAM.

Determining capacities of containers and vehicles

Container number (nk) is computed as follows

Where p is population living in the area and Pk is population for a container. Pk is written as

Where Vk is the volume of a container (m3) and VRP is the volume of solid waste per person (m3).

VRP is found thus:

VR is the volume of MSW per residence (m3), PR is the number of people per residence. Solid waste container number to be collected by a vehicle (nk) is presented as follows. 

where Vv is the volume of a vehicle (m3) and α is vehicle compaction factor.

where PR = 4, VR =.0088, Vk = 0.3m3 , P = 30,000, nk = 220, and α  = 0.8

RESULTS AND DISCUSSION

Comparison between existing situations and optimal results in Onitsha were done with respect to cost, time and distance travelled as shown in Table 1 and Table 2. Table 2 revealed 16.31% reduction in travelled length and 25.24% saving in collection cost. The optimal collection was N 218, 602.00 per day. In the current practice in Onitsha, ANSEPA employed four (4) vehicles, with operating cost of approximately N 292, 400.00.  Therefore, daily saving of proposed solution was about N73, 798.00 in collection cost and one vehicle.  Cutting down the work of one vehicle would not only reduce labour and maintenance cost, but also greatly reduces total travelling distance and fuel consumption

The optimized route number and travel distances for truck types were obtained as shown in Table 3. In GRA (Onitsha) situation, vehicles of different capacities were used; open loader (5m3), rear loading compactor (7.5m3) and container truck (15m3). The total length of routes using container truck was 81.87km and that using rear loading compactor was 104.2 km. Open loader had a total travel distance of 132.1km. Optimum route length required to completely service GRA is a function of truck volume and crew size. Smaller vehicles would be required to make a greater number of trips to the refuse disposal area than would large vehicles in order to service a given collection area.  Route length seemed to generally increase with decrease in vehicle size. Table 4 shows the total cost comparison among vehicle classes for GRA. The total cost for using 5 m3 vehicle was N 302,866.00 per day and for 7.5 m3 vehicle was N 252,072.00. For 15m3 vehicle, it was N 218,602.00. In this route optimization, the use of 15 m3 vehicle would be the most optimal

Table 1:  Time and distance comparison between existing and optimal systems for GRA, Onitsha

Route Name

Route distance, km

Route Time, s

Optimized Route distance, km

Route Time, s

Route 1

Route 2

Route 3

Route 4

Route 5

Route 6

Route 7

11.43

14.14

13.22

12.44

15.73

15.78

15.08

2280

2940

2760

2820

3300

3000

3060

16.54

12.44

15.11

11.46

12.62

13.70

-

2780

2440

2680

2340

2480

2700

-

Total

97.82

20,160

81.87

15,420

Table 2: Comparison between existing and optimal systems for GRA

Existing

Optimal

1

2

3

4

5

Total number of collection vehicles required per day

Total vehicle distance travelled for collection per day (km)

Costing of hiring of collection vehicles and labour (N )

Travel time, s

Percentage savings

In route length

In collection cost

In collection time

4

97.82

292,400

20,160

3

81.87

218,602

15,420

16.31%

25.24%

23.51%

Table 3: Optimized route number and travel distances for truck types

Vehicle capacity, m3

Total container number

Container number per vehicle

Vehicle route number per day

Vehicle travel distance per day, km

Collection

Hauling

5

7.5

15

220

220

220

14

20

40

16

11

6

36.1

38.2

45.87

96

66

36

Table 4:       Costs developed for optimized collection/ hauling as depending on truck types

Vehicle capacity, m3

Collection

N  200 km-1 ton-1

Hauling

N  120 km-1 ton-1

Total  N

5

7.5

15

116,242

123,768

148,618

186,624

128,304

69,984

302,866

252,072

218,602

CONCLUSION

Adoption of the proposed heuristics decreased the number of vehicles required to complete the service from 4 to 3. It enabled a cut back in the number of runs for trucks per day. Because of the shorter operational time and reduced runs for trucks, reductions in operational and labour cost were achieved. In the proposed algorithm, it is easier to pull a truck off the road for repair and maintenance, thus helping to extend vehicle life. The proposed heuristics provided a great deal of insight for the human router. Some portions of the routing task can be done easily by the computer while others required judgement and intuition. The new decision procedures for scheduling of solid waste collection routes would go a long way in solving the problem of indiscriminate dumping since it will reduce the collection cost, and increase the frequency of solid waste collection. Efficient routing of solid waste collection vehicles would reduce costs by reducing the labour expended in collection. The algorithm would provide optimal route, conserve energy, and reduce working hours and vehicle fuel consumption. One of the conclusions is that system analysis can be applied successfully to urban refuse management problem. The study has shown how simple heuristic methods provided decision makers with efficient solutions in the intricate problems of urban refuse administration. The success of the optimal solution provided a basis for further study on the sensitivity of the solution to the amounts of resources available.

REFERENCES

  • Agunwamba, JC; Ukpai, OK; Onyebuenyi, IC (1998). Solid waste management in Onitsha, Nigeria, Waste Management Research, 16 (1), 23-31.
  • Agunwamba, JC; Egbuniwe, N; Ogwueleka, TC (2003). Least cost management of solid waste collection.      Journal of Solid Waste Technology and Management, 29, (3), 154-167.
  • Amponsah, SK (2003). The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries, Ph.D Thesis, School of Mathematics and Statistics, University of Birmingham, UK.
  • Chang, NB; Wei, YL (2002). Comparative study between heuristics algorithm and optimization technique for vehicle routing and scheduling in the solid waste management system. Civil Engineering and Environmental System, 19, (1), 41-65
  • Greistorter, P (1994). Algorithms and implementations for the mixed capacitated Chinese Postman Problem, Working Paper 33, Department of Business, University of Graz, Austria.
  • Mourão, MC; Almeida, MT (2000).Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. European Journal of Operational Research, 121, 420-434.
  • Ogwueleka, TC (2003). Analysis of urban solid waste in Nsukka, Nigeria, Journal of Solid Waste Technology and Management, 29, (4), 234-245.
  • Wang, FS; Richardson, AJ; Roddick, FA (1996). SWIM- A computer model for solid waste integrated management. Computer, Environment and Urban Systems, 20 (4), 233- 246.

Copyright 2009 - Journal of Applied Sciences & Environmental Management 


The following images related to this document are available:

Photo images

[ja09020f1.jpg]
Home Faq Resources Email Bioline
© Bioline International, 1989 - 2019, Site last up-dated on 16-Oct-2019.
Site created and maintained by the Reference Center on Environmental Information, CRIA, Brazil
System hosted by the Internet Data Center of Rede Nacional de Ensino e Pesquisa, RNP, Brazil