Optimization of Solid Waste Collection Route at Poblacion, Tuguegarao City

A Thesis

Proposal Presented to the

Faculty of the Chemical Engineering Department

Cagayan State University Carig, Tuguegarao City

In Partial Fulfillment of the Requirements for the Degree Bachelor of Science in

Chemical Engineering

By:

Rubina C. Gonzales

Van Janssen Lim

Cherilyn S. Pasion
 February, 2019

Table of Contents

Chapter 1 ............................................................................................................................ 1

THE PROBLEM AND ITS BACKGROUND ................................................................ 1

1.1 Introduction ................................................................................................................ 1

1.2 Theoretical Framework .............................................................................................. 3

1.2.1 Boundary and Routing ........................................................................................ 3

1.2.2 Optimization and Analysis .................................................................................. 4

1.2.3 Interpretation ....................................................................................................... 5

1.3 Conceptual Framework .............................................................................................. 5

1.4 Statement of the Problem ........................................................................................... 6

1.5 Objectives .................................................................................................................. 7

1.6 Scope and Delimitations of the Study........................................................................ 7

1.7 Significance of the Study ........................................................................................... 8

1.8 Locale of the Study .................................................................................................... 8

1.9 Definition of Terms.................................................................................................... 8

Chapter 2 .......................................................................................................................... 10

REVIEW OF RELATED LITERATURES .................................................................. 10

2.1 Solid Waste .............................................................................................................. 10

2.1.1 Solid Waste Management ................................................................................. 10

2.1.2 Types of Solid Waste ........................................................................................ 10

 2.1.3 Solid Waste Collection and Disposal ................................................................ 12

2.2 Transportation and Operations Research ................................................................. 14

2.2.1 Traveling Salesman Problem (TSP).................................................................. 16

2.2.2 Formulation of TSP .......................................................................................... 18

2.2.3 Vehicle Routing Problem (VRP) ...................................................................... 19

2.3 Trip Time Model for Municipal Solid Waste Collection......................................... 21

2.4 Environmental Impact of Transportation ................................................................. 23

Chapter 3 .......................................................................................................................... 24

METHODOLOGY .......................................................................................................... 24

3.1 Data Collection ........................................................................................................ 24

3.2 Optimization of Collection Route ............................................................................ 24

3.2.1 Creation of Excel worksheet and defining the initial tour sequence. ............... 24

3.2.2 Operation of Solver dialogs .............................................................................. 24

3.2.3 Creation of the Solution .................................................................................... 25

3.3 Estimation of Route Time ........................................................................................ 25

3.4 Estimation of Fuel Consumption and Cost .............................................................. 25

3.5 Comparison of Optimized Route and Existing Route.............................................. 26

REFERENCES .................................................................................................................. 27
 List of Figures

Figure 1: Theoretical Framework ....................................................................................... 3

Figure 2: Conceptual Framework ....................................................................................... 5

Figure 3. Types of Routing Problem ................................................................................. 15

Figure 4. Illustration of the TSP problem ......................................................................... 18

 Chapter 1

THE PROBLEM AND ITS BACKGROUND

1.1 Introduction

Solid waste is defined as the unwanted products in solid state derived from the activities

which are discarded by society. It is produced either by product of production processes or

arise from domestic or commercial sectors when the materials or objects are discarded after

use (Mdido, Mujuni, & Mushi, 2013). According to the data of Cagayan Environmental Natural

Resources Office (CENRO), the total waste generation of Tuguegarao City amounted to 92,191

kilograms/day. The total amount of waste generated per day comprises 62.23% biodegradable,

27.72% residual, 9.67% recyclable, and 0.362% special waste. Also, in the projected ten-year

solid waste generation of Tuguegarao City it was projected that waste generation increases

every year for all types of waste. Biodegradable waste is the highest contributor of waste

generation while the least contributor is the special waste (CENRO, 2018).

Solid waste management (SWM) pertains to the control of the generation, storage,

collection, transfer and transport, treatment, value recovery and disposal of solid waste in a

fashion that is in accordance to societal and economic needs while at the same time compliant

to environmental standards and principles (Gyamfi, 2012). Poor design of any of these

processes increases operational cost and can result in environmental pollution. According to a

study by Sulemana et al. (2018), the collection and transportation process alone accounts 60%

to 80% of total cost for solid waste management. Inefficient solid waste collection and transport

as such will significantly affect management companies by increasing operational cost and

subsequently reducing profit. Cost reduction with respect to waste collection and transportation

is essential if sustainable solid waste management is to be achieved in developing economies.

Oduro-Kwarteng (2011), therefore calls for efficient and effective solid waste collection

through system analysis and optimization of operations. Collection and transportation of solid

1
waste should therefore be executed in ways that will ensure cost reduction as well as

environmental conservation.

Solid waste collection is widely recognized across the globe to account for majority of

expenditure on solid waste management (Aremu, 2013). According to Bonomo et al. (2013),

designing efficient urban waste collection systems has become a priority for local governments

of major cities around the world due to concerns regarding pollution, public health and the

environment as well as the budgetary impacts of the systems' transport, operating and labor

costs. The routing problem is one of the main components of garbage collection. The goal of

optimizing the route for solid waste collection is to minimize the cost at a desired level of

service (Manliguez, 2017).

In a study by Chang et al. (2002), the optimal routing problem of collection vehicles can

be classified as either a Chinese Postman Problem (CPP) or a Traveling Salesman Problem

(TSP), formulated for vehicles to perform routing over essential nodes or arcs in a network

with respect to some constraints. In the CPP, the collection vehicle is routed over the branches

of a network while in the TSP, it is routed over the nodes in a network. The routing problem in

the use of conventional method for municipal solid waste collection is essentially a TSP. It

requires the creation of the shortest tour through the assigned service points such that for every

collection operation, the full container in each service point is disposed and the empty container

is brought back to the same location.

In this study we will use spreadsheet software; Microsoft Office Excel© to find the shortest

route that the garbage trucks will follow for municipal solid waste collection of Poblacion,

Tugugarao City. The add-in “Solver” tool in Microsoft Office Excel© is considered to be a fast

and flexible tool for large and cumbersome TSPs. Also, spreadsheets allow the integration and

modification of several variables which is similar to route modeling with specialized software.

More importantly, the 2010 version of Microsoft Office Excel© contains the “alldifferent”

2
constraint and “Evolutionary Solver” which significantly reduces computation time and

provides efficient solutions based on genetic algorithms.

1.2 Theoretical Framework

Boundary Optimization and Interpretation Application

Analysis
(Vehicle Routing (Conclusion and (Implementation)
Problem) Recommendations)
(Data Gathering,
Validation of Results,
Environmental
Impacts, Comparison)

Figure 1: Theoretical Framework

1.2.1 Boundary and Routing

The boundary represents the area coverage for the collection of solid wastes that will

be taken into account for the optimization of collection route. The traditional Vehicle

Routing Problem (VRP) is an extensively studied problem in which the goal is to reduce

the total cost of driving the vehicles from a depot to serve customers and afterwards return

to the depot through optimizing route planning (Johansson, 2006). Additionally, the total

travel distance should be minimized (Nuortio, et al., 2006). VRP refers to problems in order

to determine an optimal design of routes for vehicle.

In general, VRP’s have been traditionally handled based on solutions with a static route

planning, meaning that everything is planned in advance and the information does not

3
change during the time (Ghiani, et al., 2003). However, a more advanced society is leading

to increase problems with the VRP of Municipal Solid Waste (MSW) and accordingly,

static solutions for Municipal Solid Waste Collection (MSWC) are no longer sufficient

(Menikpura, et al., 2012). A new approach has emerged where VRP’s are handled

according to a dynamic route planning in which the time variable has an important impact

towards the route planning.

1.2.2 Optimization and Analysis

This step involves the data collected needed to define the objectives of the study. The

routing problem in the use of conventional method for municipal solid waste collection is

essentially a TSP. It requires the creation of the shortest tour through the assigned service

points (container locations/nodes) such that for every collection operation, the full

container in each service point is disposed and the empty container is brought back to the

same location. General solutions to TSP include exact method (i.e branch-and-bound and

cutting plane algorithms), heuristic method (i.e nearest neighbor and sub tour reversal

algorithm), and metaheuristics, simulated annealing and genetic algorithms (Taha, 2007).

Microsoft Office Excel© is a widely used software to solve a TSP in the conventional

method for municipal solid waste collection. The add-in “Solver” tool in Microsoft Office

Excel© is considered to be a fast and flexible tool for large and cumbersome TSPs

(Rasmussen, 2011). Also, spreadsheets allow the integration and modification of several

variables which is similar to route modeling with specialized software (Jiang, 2010).

Collection of solid waste poses environmental treats. As mentioned by (Bing, et al.,

2014), the slow speed and numerous stops made by the RCV’s lead to high rates of

emission. The main greenhouse gas emitted from MSWC is carbon dioxide, although there

other kinds of harmful greenhouse gases, which are not widely discussed such as nitrous

oxide and methane. The other emissions are normally not taken into account when

4
 conducting studies about the effect of MSWC on the environment since carbon dioxide is

the main contributor to the greenhouse effect (Eisted, et al., 2009).

1.2.3 Interpretation

This step of the study involves conclusion and recommendations that are found out in

this study. As the outcome of the input data, a shortest path model must be created in order

to optimize solid waste collection/hauling processes, also minimum cost is aimed.

Optimized data results and existing data are compared to develop recommendations to draw

the intended applications of the results.

1.3 Conceptual Framework

PROCESS

• Distance Optimization of Solid Optimize route of

• Time Waste Collection using
• Fuel TSP method in Solid Waste
Consumption Spreadsheet software,
• Cost Microsoft Office
collection and

Excel© version 2016 comparison with

INPUT OUTPUT
the existing data

Figure 2: Conceptual Framework

Figure 2 shows the conceptual framework of the study. Before conducting the optimization

of the solid waste collection route using TSP method in 2016 version of Excel© , it is important

to determine the input data pertinent to the TSP method. The inputs of the system will include

distance, time, fuel consumption and cost while the output of the system will include the

5
optimized solid waste collection and comparison between the previous practice and the

optimize route.

The Travelling Salesman Problem is a well-known problem in Operations Research field.

Its importance lies on the difficulty to find the optimal solution of the certain problems due to

its computational complexity and on the large range of applications that it can be used

(Magalhães, 2012). One of the extension of TSP is the Vehicle Routing Problem (VRP). The

aim of VRP is to find a set of routes travelled by a set of vehicles. All the vehicles need to

begin and end at the same node. According to a study by Chowdhury (2017), suppose we are

considering a particular garbage collecting vehicle for which we are interested in finding out

an optimal route to do its job. Let us assume that a particular number of garbage bins are

assigned to the vehicle and the particular locations of the garbage bins are known to the driver

of the vehicle. To collect the garbage located in the bins, the truck needs to visit each of the

bins one at a time. This means that the driver has to visit all of the nodes of the graph. It can be

thought of this way: each of the vehicle has its own graph to which the vehicle is assigned.

The result will then be interpreted. The output generated will highlights unexplored areas

for enhanced efficiency in the application of optimal system designs in urban solid waste

collection. Also, the output will allow a meaningful comparison of solid waste collection

between the previous scheme of collection and the optimized route generated by TSP method.

1.4 Statement of the Problem

Solid waste collection is classified as Vehicle Routing Problem (VRP) that needs to be

addressed by the City Environment and Natural Resources Office for it account the majority

of expenditure on solid waste management. This study illustrates the application of a simple

and efficient Solver add-in tool in Microsoft Office Excel© 2016 software to optimize the route

of solid waste collection of Poblacion, Tuguegarao City.

6
The study aims to answer the following problems:

1. What is the optimized total distance travelled by the garbage trucks?

2. What is the minimized solid waste collection time?

3. How much fuel is consumed and the cost at the optimized route for collection?

4. How much CO2 emissions are produced in the optimized route?

5. What are the significant differences of the optimized route and existing route?

1.5 Objectives

This study’s purpose is to determine the optimized route of the garbage trucks that collects

the solid wastes within Poblacion, Tuguegarao City. It specifically aims to:

1. Reduce the total distance driven to collect and transport the solid wastes.

2. Lessen the overall collection time of the solid wastes.

3. Minimize the fuel consumption and cost of the garbage trucks.

4. Reduce the CO2 emission of garbage trucks.

5. Compare the optimized route results with the existing route data.

1.6 Scope and Delimitations of the Study

This study deals with the optimization of route of the garbage trucks collecting within

Poblacion, Tuguegarao City. There are five (5) different existing routes within Poblacion that

covers the collection of solid wastes from Centro 1 to Centro 10. For each route, the distances

between collection spot will be measured to serve as the input in the Excel spreadsheet and

initial route (garage) is defined to represent where the garbage truck begins and ends after a

day’s work.

7
1.7 Significance of the Study

Routing optimization of solid waste collection is recognized to provide the shortest distance

traveled through the collection spots. This will also provide a global standard route that is

software based and an efficient collection system within Poblacion, Tuguegarao City.

Moreover, the optimized collection system will be providing reduced socio-economic and

environmental impacts associated with solid waste collection.

1.8 Locale of the Study

The data gathering in this study will be conducted within the boundary Poblacion,

Tuguegarao City. Parameters such as the distances between collection spots and collection time

will be obtained from field study. Other data related required for the estimation of route are

obtained from City Environment and Natural resources Office at Tuguegarao City Hall, Carig

Sur Tuguegarao City.

1.9 Definition of Terms

Collection time- Time consumed in collecting the Garbage from one pick up point to another

Routing Optimization- the use of models to describe the transport network that needs to be

planned

Solid waste- Unwanted Products in solid state derived from the activities which are discarded

to the society

Trip Time-Total time consumed by the Solid Waste Collection unit to collect and travel the

garbage from a specified route

Travelling salesman problem (TSP)- Travelling salesman problem is algorithmic problem

tasked with finding the shortest route between a set of points and locations that must be visited.

8
Vehicle routing problem (VRP)- the vehicle routing problem is a combinational optimization

and integer programming problem seeking to service a number of customers with a fleet of

vehicles.

9
 Chapter 2

REVIEW OF RELATED LITERATURES

2.1 Solid Waste

Solid Waste is the useless, unwanted and discarded material resulting from day to day

activities in the community. These materials are disposed in our environment. Solid wastes are

generated from residential, Industrial, and commercial sources. Solid wastes are classified as

recyclable, biodegradable, residual, and special. The rate of generation of solid waste increases

every year. (Leblanc, 2018)

2.1.1 Solid Waste Management

Solid waste management is defined as the discipline associated with the control of

generation, storage, collection, transfer, processing, and disposal of solid waste materials

in a way that best addresses the range of public health, conservation, economics, aesthetic,

engineering and other environmental considerations. In its scope, solid waste management

includes planning, administrative, financial, engineering and legal functions.

The primary Goal of solid waste management is reducing and eliminating adverse

impacts of waste materials on human health and environment to support economic

development and superior quality of life. (Leblanc, 2018).

2.1.2 Types of Solid Waste

2.1.2.1 Recyclable waste

Recyclable waste are types of waste that can be recovered and reused. This waste are

marketable, it can be recycled by manufacturers to minimize production cost. Recyclable

wastes compose of metals, tins, cans, bottles, glasses, hard/soft plastic containers, rubber,

dry papers, boxes, cardboard, hard shells and other materials which can be re-used or

recycled. Approximately 25.563 tons or 27.72 % of the total wastes generated per day are

10
recyclable waste. This are derived from private establishment and public institutions in the

city being the regional center of education, commerce and trade and the location of the

Regional Government Center. (Tuguegaro City Local Government Unit, 2016)

2.1.2.2 Biodegradable waste

Biodegradable waste is defined as a type of waste typically originating from plant and

animal sources. Which maybe degraded by other living organisms. It is commonly found

in municipal waste. Green waste, food waste, paper waste, and biodegradable plastics are

considered as biodegradable waste. Biodegradable waste can be used in composting. It also

produces biogas and still delivers compost for soil. (Zaloksnis, 2010)

In Tuguegarao City Approximately 57.375 tons of wastes are generated per day where

62.23% is biodegradable materials which is a vital input for entrepreneurial activities such

as organic fertilizer production and marketing. Biodegradable wastes compose of

food/kitchen waste (fruit peelings, vegetable trims, soft shells, fish entrails, fowl innards,

food leftovers), garden wastes (leaves, twigs, weed or uncultivated plants, flowers, fruits)

and soiled toilet papers/wet papers or cartons. (Tuguegaro City Local Government Unit,

2016)

2.1.2.3 Residual waste

Residual waste are solid waste materials that are non-compostable non-recyclable. It

should be disposed ecologically through long term disposal facility or sanitary landfill.

Residual wastes compose of disposal diapers, sanitary napkins, worn-out rugs, cartons for

milk and juice containers, composite packaging (tetra packs), ceramics, candy

wrappers/sachets, containers made from multiple layers of plastics/polyvinyl chloride

(PVC) and other soiled materials that cannot be composted. The quantity of residual wastes

11
generated has been reduced because some wastes categorized as residual like disposable

glasses, rubber and others are being bought by junkshops

From the WACS result of the city, residual waste is approximately 8.919 tons per day.

(Tuguegaro City Local Government Unit, 2016)

2.1.2.4 Special waste

Special waste is defined as waste that requires special handling, trained people, and/or

disposal methods. A waste can be considered as special waste because of its quantity,

concentration, or physical chemical, or biological characteristics. Special wastes are

composed of Toxic and Hazardous Wastes (THWs) and Health Care wastes. THWs come

in the form of dry cell batteries, lead-acid storage batteries, chemical containers, aerosol

cans and related items, automotive rugs and discards, sharp materials and broken

glasses/bottles, industrial or backyard production residue and sludge, and others. These

wastes are disposed in a septic vault within the SLF compound. Some wastes toxic and

hazardous waste are bought by junkshops who, in turn, sell them back to manufacturers for

reuse. Approximately 334 kilograms per day or .362 % of the total waste generated are

special wastes (Tuguegaro City Local Government Unit, 2016)

2.1.3 Solid Waste Collection and Disposal

Solid Waste Collection and disposal of Local municipalities is governed by the R.A.

No. 9003 of 2000 and R. A. No. 7160, otherwise known as the Local government code.

Which declared that the policy of the state to adopt a systematic, comprehensive, and

ecological solid waste management program. One of the highlights of the law is the

segregation of Solid waste such as Recyclable, Biodegradable, Special, and residual wastes.

The law promotes the act of providing a source-separated recyclable material located either

at a disposal site or at another location more convenient to the population being served, and

12
collection at least once a month of source-separated recyclable material from collection

service customers and to providing a public education and promotion program that gives

notice to each person of the opportunity to recycle and encourage source separation of

recyclable material. Section 10 of R.A. No. 9003 of 2000 stated that Segregation and

collection of solid waste shall be conducted at the barangay level specifically for

biodegradable, compostable and reusable wastes: Provided, that the collection of non-

recyclable materials and special wastes shall be the responsibility of the municipality or

city. The transportation of solid waste is from the collection points to the dumpsites through

dump trucks provided and owned by the city Government.

2.1.3.1 Landfills

Landfills is specified site of waste disposal by the local Government for the

municipality. Waste are stored by burial. Landfills are isolated in places that is far from a

natural resource such as water bodies and residential locations. It is the most common

method to organize waste disposal. The waste is isolated from the environment until it is

completely degraded biologically, chemically, and physically. For a site to be considered

as landfills there are four basic conditions to meet. The site should be full of partial

hydrogeological isolation, formal engineering preparations, permanent control, planned

waste emplacement and covering.

2.1.3.2 Composting

Composting is defined as the process of controlled biological maturity under aerobic

conditions, where organic matter of animal or vegetal origin is decomposed to materials

with shorter molecular chains more stable and hygienic, humus rich, and finally beneficial

for the agricultural crops and for recycling of soil organic matter (Sequi, 1996). In the other

hand composting is another way of reducing Solid wastes aside from recycling materials

that will be stored in the landfill.

13
 2.1.3.3 Incineration

Incineration is a waste treatment process that involves the combustion of organic

substance contained in waste materials. The process converts waste materials into ash, flue

gas, and heat. Heat produce is usually used in energy production. (Nidon, 2017)

2.2 Transportation and Operations Research

Transportation is a key decision area within logistics, not only because of the percentage

of the total costs that it absorbs, but also because of its role in the performance of logistic

systems. Therefore, multiple decisions are studied within this area and OR analytical analysis

and solution approaches play an important role in this domain. Proof of that is the study realized

by Psaraftis, which identified in the literature six families of transportation models: (1) Vehicle

Routing; (2) Shortest Path; (3) Traffic Assignment; (4) Fleet Management; (5) Air Traffic

Control and (6) Facility Location Models (Eksioglu, et al., 2009).

De Aguiar (2010) stated in her study that routing problems have been receiving extensive

treatment in the literature because of its great complexity and consequently, difficulty in

generating good or optimal solutions. Additionally, the potential for improvements is high and

there are numerous real life applications.

In this type of problems, the road network is generally described through a graph consisting

of vertices connected by edges. At this point, it is common to distinguish between (1) node-

covering problems, in which customers are at the vertices and the edges correspond to the costs

of travelling between the vertices and (2) edge-covering-problems, where customers are along

the edges which represent road sections (Larson, 1981). Graphs might be undirected if there is

no distinction in the way edges are traversed or directed, if there are differences of costs in both

directions of the edges or even the existence of one direction only.

14
 In Figure 3 one can see the most addressed problems regarding the two classes of routing

problems mentioned above.

Chinese Postman
Problem

Edge Covering Rural Postman

Problems Problem

Capacitated arc
Routing Problem
Routing
Problems
Travelling
Salesman Problem

Node Covering m-Travelling

Problems Salesman Problem

Vehicle Routing
Problem

Figure 3. Types of Routing Problem

The Chinese Postman Problem was first defined by Guan in 1962 and consists of

determining the shortest circuit to traverse every edge of a graph at least once (Codeau &

Laporte, 2006). However, in several arc routing contexts, it is not necessary to traverse all

edges of a graph but only a subset of required edges. The Rural Postman Problem was

introduced by Orloff in 1974 and consists of determining a minimum cost circuit through a

subset of edges that includes all these required edges (Codeau & Laporte, 2006). When the

problem involves the design of multiple tours, the Capacitated Arc Routing Problem is more

appropriate. It aims to determine a least cost traversal of all edges of the graph, by using the

available vehicles in such a way that each vehicle starts and ends at the same location and the

15
total demand of customers associated with each vehicle route does not exceed its capacity. This

problem was introduced by Golden and Wong in 1981 (Codeau & Laporte, 2006).

Concerning node-covering-problems, the most fundamental and best known one is the

Travelling Salesman Problem. It consists of determining the minimum distance route that

begins at a given node of a network, visits all the members of a specific set of vertices at least

once, and returns to the initial vertex. Its mathematical version was introduced in the 1800s by

Hamilton and Kirkmanin (2010). The m-travelling salesman problem, on the other hand,

involves the design of a pre-specified number of distinct tours that collectively visit all the

demanded points at least once (Larson, 1981). When there are constraints of vehicle capacity

or maximum-distance types, there is the Vehicle Routing Problem.

The study of De Aguiar (2010) decided to model the problem of the case study as a Vehicle

Routing Problem. The area in study has rural areas where containers are various streets apart

and the magnitude of the distances between them assume more importance than the exact path.

By not considering the complete road network, the complexity of the problem decreases

significantly. Edge-covering-problems would be more appropriate in problems where the waste

collection is done door-to-door or in a totally urban area, where containers exist in almost every

street.

2.2.1 Traveling Salesman Problem (TSP)

According to Matai (2010), traveling salesman problem (TSP) were studied in the 18th

century by a mathematician from Ireland named Sir William Rowam Hamilton and by the

British mathematician named Thomas Penyngton Kirkman. Detailed discussion about the

work of Hamilton & Kirkman can be seen from the book titled Graph Theory (Biggs, Keith,

& Wilson, 1736). It is believed that the general form of the TSP has been first studied by

Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney

16
& Merrill at Princeton. A detailed dscription about the connection between Menger &

Whitney, and the development of the TSP can be found in (Schrijver, 1960).

Also, according to Matai (2010), the definition of TSP is in a given a set of cities and

the cost of travel (or distance) between each possible pairs, the TSP, is to find the best

possible way of visiting all the cities and returning to the starting point that minimize the

travel cost (or travel distance).

Travelling salesman problems are easy to describe: a salesman needs to visit all his

customers located in different cities in his region, and he would like to find the cheapest

tour that will assure that all cities have been visited. Unfortunately, TSP is not so easy to

formulate, and relatively hard to solve. When making a mathematical formulation of these

problems we will for the most part use a network framework. The cities are then called

nodes, and the roads connecting the cities are called arcs (Rasmussen).

In a study by Aremu (2013), he applied the simple and efficient Solver add-in tool in

Microsoft Office Excel© 2010 software for in-town tour optimization of solid waste

collection. The data required in his study for was obtained from the municipal authority,

field studies, and a digitized map of Ilorin, Nigeria while collection operation was

formulated as a Traveling Salesman Problem on Excel spreadsheet. The results obtained

from the optimization of ten prominent routes revealed that two empirical routes had the

same tour distance as the optimized tour. However, in the remaining eight routes, the

optimization process reduced tour distance by 2.04-19.27 %, tour time by 0.33-22.80 %,

and fuel consumption by 1.78-20.54 %. The cost incurred in purchasing diesel is also

expected to decrease by US$0.11 US$1.65/vehicle/day. Therefore, the proposed method

can serve as a valuable tool for reducing some socio-economic and environmental impacts

associated with solid waste collection.

17
2.2.2 Formulation of TSP

As mentioned earlier, in the TSP, a set of n cites and a way of measuring the distance

between each city is given. The objective is to find shortest tour that visits all cities exactly

once and returns back to the starting city.

In the model below, the starting city is considered node 1 (depot), where i represents

the current visited node and j represents the next node to be visited (El-Gharably, et al.,

2013). A distance dxi,yj is associated with each arc and represents the distance travelled from

node Xi to node Yj; as shown in Figure 4.

Y1=B
B Y1=X2

dX2,Y2

A X1=Depot
Yn=Depot
DEPOT

E C

Figure 4. Illustration of the TSP problem

Given a symmetric network, the decision variable is Yj; where, Yj determines the value

of the next customer to be visited by the vehicle. Xi variable represents the value of the start

node of the arc; while, Yj represents the next destination node, which is then considered as

the start node of the following arc. Generally, the use of loop segments is not allowed

(leaving a node then arriving to same node, Xi, Yj, as all nodes must be visited exactly once.

Sxi,yj is a binary variable to represent the passing of the vehicle on arc (Xi, Yj). Sxi,yj is given

18
a value of 1 if arc (Xi, Yj) belongs to the optimum route, 0 otherwise. The problem can be

formulated as follows:

n n
MinimizeZ   S xi ,yj  d xi ,yj (1)
j 1 i 1

Subject to:

X1 = 1 (2)

Yn = 1 (3)

Xi+1 = Yj (4)

Xi ≤ n (5)

Yj ≥ n (6)

S
j 1
xi , yj 1 i  1,...,n (7)

S
i 1
xi , yj 1 i  1,..., n (8)

xi , y j  0 and integer (9)

The objective function (1) minimizes the total travel distance. Constraints (2) and (3)

ensure that the route starts and ends at the depot. Constraint (4) ensures that routes are not

segmented, that is, if a vehicle arrives at a city, it eventually leaves the city again; where, i

and j are equal for the same arc. Constraints (5) and (6) state the range of values given (the

number of nodes, n). Constraints (7) and (8) ensure that every city is visited exactly once.

Finally, constraint (9) is the non-negativity constraint and guarantees that the variables can

assume integer values only (El-Gharably, et al., 2013).

2.2.3 Vehicle Routing Problem (VRP)

In the study of El-Gharby et al. (2013), they stated that vehicle routing problem (VRP)

is one of the most intensively studied problems in operations research, and this is due to its

19
structural charm as well as practical relevance. Many papers have been devoted to the

development of optimization and approximation algorithms for vehicle routing and

scheduling problems. This interest is due to the practical importance of effective and

efficient methods for handling physical distribution situations as well as to the intriguing

nature of the underlying combinatorial optimization models. The standard Vehicle Routing

Problem (VRP)is an extension of the Travelling Salesman Problem (TSP), introducing

demand at the customers and a fleet of vehicles, each having the same fixed capacity.

According to Fu et al. (2008), VRP calls for the determination of a set of minimum cost

routes to be performed by a fleet of vehicles to serve a given set of customers with known

demands; where, each route originates and terminates at a single depot. Each customer must

be assigned to only one vehicle and the total demand of all customers assigned to a vehicle

does not exceed its capacity.

Namany (2017) stated in his study that VRP is a complicated optimization problem. Its

manual implementation can be quite laborious, and involves tedious computations. An easy

way to understand the manual method is to solve a TSP, which is a special case of the VRP,

where only one vehicle serves all the stations. In fact, the formulation of the problem is

very simple. The vehicle needs to begin its trip from a specific predetermined point, and

traverse several customers or stations along the way, before making its way back to the

original station. The goal is to make the trip at the lowest possible cost.

Namany (2017) also stated that, before solving the problem, the first step is to define

the problem mathematically. The following equations shows the integer linear

programming formulation of the TSP.

n n
F  Min  d ij xij (10)
i 1 j 1

20
 n

x
j 1
ij 1;i 1,..., n (11)

x
i 1
ij 1;i 1,..., n (12)

xij  0 or 1 (13)

The objective function for this problem is to minimize the distance between two

stations i and j denoted by dij. The two constraints are related to the in degree and the

out degree. In other words, the vehicle must go from i to only one city j, and if a vehicle

enters a city j it should have come from one single city i. The decision variable is binary,

denoted by xij. It is equal to 1 when the path ij is traversed, and 0 when the path xij is

not passed through (Namany, 2017).

2.3 Trip Time Model for Municipal Solid Waste Collection

Collection costs and emissions are linearly related to time, one way to reduce the economic,

health and environmental impacts of solid waste collection activities is to efficiently manage

or reduce the time spent on the various activities that comprise collection (Aremu, et al., 2010).

The generalized time required for a complete trip is the sum of the time required to perform

the unit operations and the unproductive times lost to delay and other random events. The time

per trip is given by the following equation:

Ttt = α( Put + Pdt + St + hts + h fs + Dt )

where Ttt is the time per trip for collecting solid waste, hr/trip, α is the off-route factor, which

is greater than one.

It accounts for the time spent on off-route activities. Put is the average pick-up time per

trip, hr/trip, Pdt is the average drop-down time per trip, hr/trip, st is the average at disposal site

time per trip, hr/trip, hts is the haul time to the disposal site per trip, hr/trip, hfs is the haul time

from the disposal site per trip, hr/trip and Dt is the total delay:

21
 Dt = tturn × Nturn + tint er × Nint er

where tturn is the average time spent at turns, tinter is the average time spent at intersections,

Nturn is the number of turns in a collection trip and Ninter is the number of intersections in a

collection trip.

In a study conducted by (Aremu, et al., 2016) the following summary of time spent

activities during collection are found out.

Table 1: Summary of time spent on activities during collection

Parameter Unit Range Average

Pickup time (Put) hr/trip 0.013–0.054 0.028

Time spent at intersections hr 0.002–0.016 0.0064

Time spent at turn hr 0.002–0.009 0.003

Off route time hr/trip 0.000–0.058 0.023

At disposal site time hr/trip 0.011–0.054 0.023

Drop off time (Pdt) hr/trip 0.016–0.075 0.030

Therefore, the average off-route time represents about 2% of the collection time; therefore, the

off-route factor is taken as 1.02. The generalized trip time model is given as

(
Ttt = 1.02 0.081 + 0.034xts + 0.030x fs + 0.003Nturn + 0.006 Nint er )
Where Ttt is the trip time for collecting solid waste from service point, hr/trip

xts is the haul distance from service point to disposal site, km/trip

x fs is the haul distance from disposal site to the same service point km/trip

Nturn is the number of turns made during the collection trip

Nint er is the number of intersections encountered during the collection trip.

22
2.4 Environmental Impact of Transportation

Transporting the solid waste to the landfill requires a vehicle to carry out the load. These

vehicles emit greenhouse gases through the combustion of fossil fuels trucks with diesel

engines specifically. The study aims to reduce the fuel consumed by optimizing the route of

the solid waste collection hence it also reduces the greenhouse gas emission. The fuel

consumption varies with the engine speed and load of the vehicle. Increasing Engine speeds

reduces NOX Emissions because as the Engine speed gets higher the catalytic converter is heat

up to operate efficiently and the engine will achieve complete combustion.

The following equations can be used to calculate the fuel consumption and CO2 Emission

of trucks with diesel Engines

Distance travelled(Km)
Fuel Consumption 
Volume of fuel consumed (L)

Emission [Kg CO2]  (fuel consumed)[L]  (CO2 Emission Factor)

Emission[Kg CH4]  (fuel consumed)[L]  (CH4 Emissiojn Factor)

Emission Kg NO2  (Fuel consumed) L (NO2 Emission Factor)

In this study we will choose TSP method to optimize the Solid Waste Collection of

Poblacion, Tuguegarao City. The trip time and cost of fuel consumption will also be calculated

using the model by Aremu et al. (2010).

23
 Chapter 3

METHODOLOGY

3.1 Data Collection

Data will be requested to Tuguegarao City Environment and Natural Resources Office

including the map of Poblacion, Tuguegarao City, distances of streets within the boundary of

Poblacion, Tuguegarao City, number operating garbage trucks, schedule of collection and fuel

consumption. Other data such as garbage truck collection route, garbage collection points and

collection time will be obtained through field study.

3.2 Optimization of Collection Route

The optimization model to solve a traveling salesman problem (TSP) using the solver add-

in tool in Microsoft Excel© 2016 was developed by (Jiang, 2010). The procedure involves the

three following steps:

3.2.1 Creation of Excel worksheet and defining the initial tour sequence.

In this step, an origin-destination (O-D) matrix for each route which represents the

Euclidean mileage matrix of all the nodes in the route is created in Excel spreadsheet. Next,

the initial tour is defined such that the collection vehicle begins and ends the day’s work at

garage (G). The Excel function VLOOKUP() is then used to obtain the waste bins

associated with the integer values in the initial tour. The distance from one waste bin to the

next is found using the Excel function INDEX and this instruction finds the associated

distance from the O-D matrix.

3.2.2 Operation of Solver dialogs

The solver dialogs are activated to define the objective, cells to change, constraints, and

the solution method. The objective is defined by the spreadsheet cell to optimize; that is to

minimize the cell which contains the total tour distance. The cells to change in order to

minimize the total distance are those cells which hold the integer values assigned to the

24
 waste bin locations. The constraint in this problem is that there will be only one entry and

one exit to each waste bin, and the route will end where it began. This is implemented by

declaring that the values in cells assigned to the waste bin locations will be “all different”

and this option is available in Microsoft Excel 2016. The solution method selected is the

“Evolutionary” method i.e. using genetic algorithm.

3.2.3 Creation of the Solution

The solution to TSP in Microsoft Excel using the Solver dialog box is obtained by

clicking the solve button. Once the solve button is clicked, the Solver performs some

iterations by rearranging the tour sequence. Finally, the optimal solution is presented.

3.3 Estimation of Route Time

The time required for a complete collection trip using the conventional mode is given by

(Aremu, et al., 2011) as:

(
Ttt = 1.02 0.081 + 0.034xts + 0.030x fs + 0.003Nturn + 0.006 Nint er )
Where Ttt is the trip time for collecting solid waste from service point, hr/trip

xts is the haul distance from service point to disposal site, km/trip

x fs is the haul distance from disposal site to the same service point km/trip

Nturn is the number of turns made during the collection trip

Nint er is the number of intersections encountered during the collection trip

3.4 Estimation of Fuel Consumption and Cost

The fuel consumed by the collection vehicle during each tour was estimated using values

reported by (Nguyen & Wilson, 2010). The fuel consumed when the collection vehicle is

stationary at turns and intersections was estimated as 3.15 L/hr, while the fuel consumed during

the movement was reported as 0.335L/km. The total amount of diesel consumed per tour (TDt)

is given as:

25
equation

Where xdi/i+1 is the distance from service point i to service point i + 1

xd1 is the distance from the garage to the first service point

xd2 is the distance from the last service point (n) to the garage

3.5 Comparison of Optimized Route and Existing Route

The optimized tours generated from the Microsoft Excel© Solver tool will be compared

with empirical route generated by officials of the waste management Tuguegarao City

Environment and Natural Resources Office. Euclidean distance from the empirically generated

tour and the distance obtained from the Solver solution were used for analyses.

26
REFERENCES

[1] (2010, May 21). Retrieved from The Travelling Salesman Problem History:

http://www.tsp.gatech.edu/history/index.html.

[2] Aguiar, M. T. (2010). Optimization Techniques for the Mixed Urban Rural Solid Waste

Collection Problem. 90.

[3] Aremu, A. S. (2013). In-town Tour Optimization of Conventional Mode for Municipal

Solid wastte Collection. NIJOTECH, 7.

[4] Aremu, A.S., Mihelcic, J.R., Sule, & B.F. (2010). Time and motion analysis of hauled

container system for municipal solid waste collection in Ilorin, Kwara State, Nigeria.

Proceedings of the 25th International Conference on Solid Waste Technology and

Management.

[5] Aremu, A.S., Mihelcic, J.R., Sule, & B.F. (2011). Trip Time Model for Municipal Solid

Waste Collection Applicable to Developing Countries. Environmental Technology.

[6] Biggs, N. L., Keith, L., & Wilson, R. J. (1736). Graph Theory. Calderon.

[7] Bing, X., de Keizer, M., Bloemhof-Ruwaard, J. M., . . . G., J. (2014). Vehicle routing for

the eco-efficient collection of household plastic waste. Waste Management.

[8] Bonomo, F., Durán, G., Larumbe, F., & Marenco, J. (2013). A Method for Optimizing

Waste Collection Using Mathematical Programming: A Buenos Aires Case Study.

Departamento de Matemática, FCEyN, Universidad de Buenos Aires, ARGENTINA.

[9] CENRO. (2018). Updated Ten year Ecological solid Waste Management Plan. Tuguegarao

City.

27
[10] Chowdhury, M. M. (2017). Garbage Collection Routing Based on Traveling Salesman

Problem. 71.

[11] Codeau, J.-F., & Laporte, G. (2006). Modeling and optimization of vehicle routing and

arc routing problems. In Handbook on Modelling for discrete optimization (p. 40).

Springer US.

[12] Eisted, R., Larsen, A. W., Christensen, & H., T. (2009). Collection, transfer and transport

of waste: accounting of greenhouse gases and global warming contribution. Waste

Management & Research.

[13] Eksioglu, Burak, Vural, Volkan, A., Reisman, & Arnorld. (2009). The vehicle routing

problem; A taxonomic review. Computers and Industrial Engineering, 11.

[14] El-Gharably, E., N., El-Kilany, Khaled, El-Sayed, & E., A. (2013). Optimization Using

Simulation of the Vehicle Routing Problem. International Journal of Industrial and

Manufacturing Engineering, 7.

[15] Fu, Z., Eglese, R., Li, & L. (2008). A unified tabu search algorithm for vehicle routing

problems with soft time windows. Journal of the Operational Research society, 11.

[16] Ghiani, G., Guerriero, F., Laporte, G., . . . R. (2003). Real-time vehicle routing: Solution

concepts, algorithms and parallel computing strategies. European Journal of

Operational Research, 1-11.

[17] Gyamfi, M. (2012). SEQUENTIAL ORDERING OF ROUTES FOR TRUCKS FOR

EFFICIENT GARBAGE COLLECTION: CASE STUDY OF SEKONDI –TAKORADI

METROPOLITAN ASSEMBLY (STMA). Sekondi-Takoradi Metropolitan: A Thesis

Submitted to Department of Mathematics, Kwame Nkrumah University of Science and

Technology in Partial Fulfillment of the Requirements for the Degree of.

28
[18] Jiang, C. (2010). “A Reliable Solver of Euclidean Traveling Salesman Problems with

Microsoft Excel Add-in Tools for Small-Size Systems. Journal of Software.

[19] Johansson, O. M. (2006). The Effect of Dynamic Scheduling and Routing in a Solid Waste

Management System. Waste Management, 875-885.

[20] Larson, R. C. (1981). Urban operations research. MIT.

[21] Leblanc, R. (2018, October 20). The balance smb. Retrieved from

www.thebancesmb.com.

[22] Magalhães, M. S. (2012). Route Optimization for the Solid Waste Collection.

FACULDADE DE ENGENHARIA DA UNIVERSIDADE DO PORTO, 79.

[23] Manliguez, C. (2017). Solid Waste Collection Routing Optimization using Hybridized

Modified Discrete Firefly Algorithm and Simulated Annealing - A Case Study in Davao

City, Philippines. ResearchGate, 13.

[24] Matai, R., Singh, S. P., & Mittal, M. L. (2010). Traveling Salesman Problem: An

Overview of Applications, Formulations, and Solution Approaches . ResearchGate, 25.

[25] Mdido, K., Mujuni, E., & Mushi, A. (2013). Optimization of Municipal Solid Waste

Management Problem with Composting Plants: The case of Ilala Municipality. Ilala

Municipality: International Journal of Advances in Computer Science and Technology,.

[26] Menikpura, S. N. M., Gheewala, S. H., Bonnet, & S. (2012). Framework for life cycle

sustainability assessment of municipal solid waste management systems with an

application to a case study in Thailand. Waste Management & Research.

[27] N.B., C., & Y.L., W. (2002). Comparative Study Between Heuristic algorithm and

Optimization technique for Vehicle Routing and Scheduling in a Solid Waste

Collection system. Civil Engineering and Environmental System, 26.

29
[28] Namany, S. (2017). Capacitated Vehicle Routing Problem with Variable Fleet of Delivery

Vehicles of Uniform Capacity. 57.

[29] Nguyen, T., & Wilson, B. (2010). Fuel Consumption Estimation for Kerbside Municipal

Solid Waste (MSW) Collection Activities. Waste Management & Research.

[30] Nidon, P. G. (2017). Incineration process for solid waste managemnt and effective

utilization of by products. International process for solid waste management and

efective utilization of by products.

[31] Nuortio, T., Kytöjoki, J., Niska, H., . . . O. (2006). Improved route planning and scheduling

of waste collection and transport. Expert Systems with Applications, 223-232.

[32] Oduro-Kwarteng, S. (2011). Private Sector Involvement in Urban Solid waste Collection.

CRC Press.

[33] Rasmussen, R. (2011). “TSP in Spreadsheets - A Fast and Flexible Tool. Omega.

[34] Schrijver, A. (1960). Theory of linear and integer Programming. John Wiley & Sons.

[35] Sequi, K. (1996). Composting of food and agriculutral wastes.

[36] Sulemana, Alhassan, Donkor, A., E., Forkuo, E. K., & Oduro-Kwarteng, S. (2018).

Optimal Routing of Solid Waste Collection Trucks: A Review of Methods. Hindawi,

12.

[37] Taha, H. (2007). Operations Research: An Introduction. Prentice-Hall, Inc.

[38] Tuguegaro City Local Government Unit. (2016). Updated 10 year Ecological solid nwaste

management plan. Tuguegarao City.

[39] Zaloksnis, D. J. (2010).

30
31