Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman

Wastewater treatment (WWT) is a process in which the solids in wastewater are partially removed and changed into relatively stable organic solids by breaking down complex organic solids. Wastewater treatment can be modelled as shortest route problem because it can improve the description, which is c...

Full description

Saved in:
Bibliographic Details
Main Authors: Abdul Ariff, Abdul Qadir, Mohd Azmi, Nor Atiqah, Wan Mohd Aziman, Wan Ainaa Asyiqin
Format: Student Project
Language:English
Published: 2023
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/93561/1/93561.pdf
https://ir.uitm.edu.my/id/eprint/93561/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uitm.ir.93561
record_format eprints
spelling my.uitm.ir.935612024-04-20T01:06:05Z https://ir.uitm.edu.my/id/eprint/93561/ Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman Abdul Ariff, Abdul Qadir Mohd Azmi, Nor Atiqah Wan Mohd Aziman, Wan Ainaa Asyiqin Dissertations, Academic. Preparation of theses Wastewater treatment (WWT) is a process in which the solids in wastewater are partially removed and changed into relatively stable organic solids by breaking down complex organic solids. Wastewater treatment can be modelled as shortest route problem because it can improve the description, which is clearer and easier to observe in minimizing the costs of the wastewater treatment process. Shortest route problems are some of the most researched network flow optimization problems, with attractive applications in a variety of fields. One method for selecting the best approaches or restrictions that are actually required for every process is integer linear programming, which may also select the process of constraints that is the most affordable. Each step in the wastewater treatment process costs a lot of money. This is because there is no optimal sequences of treatment process selected that can minimize the cost for three different cases which are marine discharge, non-vegetable irrigation and boiler feed reuse. This can be proven when all the 15 sequence of nodes are selected to run the process of wastewater treatment. Hence the objective of this study is to treat the wastewater treatment at the lowest possible cost while considering the acceptable pollutant levels for three different cases which are marine discharge, nonvegetable irrigation and boiler feed reuse. The integer linear programming model was solved using Excel Solver. The best wastewater treatment process with the minimum cost for each cases were obtained. The overall cost if the wastewater treatment undergoes all the process is RM 3286. However, the findings indicate the total minimum cost incurred for are marine discharge, non-vegetable irrigation and boiler feed reuse are RM 343, RM 913 and RM 902, respectively. The results are described and discussed based on the sequence of nodes selected. The total sequence of nodes selected for marine discharge, non-vegetable irrigation and boiler feed reuse are 8, 11 and 9 respectively. Due to this, there are a huge different between total actual cost and the total cost after the optimal nodes selected. 2023 Student Project NonPeerReviewed text en https://ir.uitm.edu.my/id/eprint/93561/1/93561.pdf Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman. (2023) [Student Project] (Unpublished)
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
topic Dissertations, Academic. Preparation of theses
spellingShingle Dissertations, Academic. Preparation of theses
Abdul Ariff, Abdul Qadir
Mohd Azmi, Nor Atiqah
Wan Mohd Aziman, Wan Ainaa Asyiqin
Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman
description Wastewater treatment (WWT) is a process in which the solids in wastewater are partially removed and changed into relatively stable organic solids by breaking down complex organic solids. Wastewater treatment can be modelled as shortest route problem because it can improve the description, which is clearer and easier to observe in minimizing the costs of the wastewater treatment process. Shortest route problems are some of the most researched network flow optimization problems, with attractive applications in a variety of fields. One method for selecting the best approaches or restrictions that are actually required for every process is integer linear programming, which may also select the process of constraints that is the most affordable. Each step in the wastewater treatment process costs a lot of money. This is because there is no optimal sequences of treatment process selected that can minimize the cost for three different cases which are marine discharge, non-vegetable irrigation and boiler feed reuse. This can be proven when all the 15 sequence of nodes are selected to run the process of wastewater treatment. Hence the objective of this study is to treat the wastewater treatment at the lowest possible cost while considering the acceptable pollutant levels for three different cases which are marine discharge, nonvegetable irrigation and boiler feed reuse. The integer linear programming model was solved using Excel Solver. The best wastewater treatment process with the minimum cost for each cases were obtained. The overall cost if the wastewater treatment undergoes all the process is RM 3286. However, the findings indicate the total minimum cost incurred for are marine discharge, non-vegetable irrigation and boiler feed reuse are RM 343, RM 913 and RM 902, respectively. The results are described and discussed based on the sequence of nodes selected. The total sequence of nodes selected for marine discharge, non-vegetable irrigation and boiler feed reuse are 8, 11 and 9 respectively. Due to this, there are a huge different between total actual cost and the total cost after the optimal nodes selected.
format Student Project
author Abdul Ariff, Abdul Qadir
Mohd Azmi, Nor Atiqah
Wan Mohd Aziman, Wan Ainaa Asyiqin
author_facet Abdul Ariff, Abdul Qadir
Mohd Azmi, Nor Atiqah
Wan Mohd Aziman, Wan Ainaa Asyiqin
author_sort Abdul Ariff, Abdul Qadir
title Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman
title_short Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman
title_full Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman
title_fullStr Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman
title_full_unstemmed Solving wastewater treatment process network as a shortest route problem using integer linear programming / Abdul Qadir Abdul Ariff, Nor Atiqah Mohd Azmi and Wan Ainaa Asyiqin Wan Mohd Aziman
title_sort solving wastewater treatment process network as a shortest route problem using integer linear programming / abdul qadir abdul ariff, nor atiqah mohd azmi and wan ainaa asyiqin wan mohd aziman
publishDate 2023
url https://ir.uitm.edu.my/id/eprint/93561/1/93561.pdf
https://ir.uitm.edu.my/id/eprint/93561/
_version_ 1797925030423691264
score 13.214268