A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions

This research focuses on two solid waste management (SWM) problems, particularly the landfill site selection problem (LSSP) and the waste collection vehicle routing problem (WCVRP). Solving LSSP involves the evaluation of multiple criteria to determine the best landfill location. Whereas WCVRP invol...

Full description

Saved in:

Bibliographic Details
Main Author:	Nur Azriati, Mat
Format:	Thesis
Language:	eng eng
Published:	2023
Subjects:	QA273-280 Probabilities Mathematical statistics
Online Access:	https://etd.uum.edu.my/10935/1/Depositpermission_s900803.pdf https://etd.uum.edu.my/10935/2/s900803_01.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uum-etd.10935
record_format	uketd_dc
spelling	my-uum-etd.109352024-01-31T07:41:44Z A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions 2023 Nur Azriati, Mat Benjamin, Aida Mauziah Abdul Rahman, Syariza Awang Had Salleh Graduate School of Arts & Sciences Awang Had Salleh Graduates School of Arts & Sciences QA273-280 Probabilities. Mathematical statistics This research focuses on two solid waste management (SWM) problems, particularly the landfill site selection problem (LSSP) and the waste collection vehicle routing problem (WCVRP). Solving LSSP involves the evaluation of multiple criteria to determine the best landfill location. Whereas WCVRP involves, the construction of vehicle routes for collecting waste from customers and discharging their loads at the landfills with the minimum total distance travelled. However, there are two main issues with the existing LSSP and WCVRP models. First, previous models focused only on a single landfill site based on the highest score without considering the operational costs criterion in solving LSSP. Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. Thus, this research proposes a greedy heuristics multiple criteria model which includes operational costs for solving multi-LSSP and develops PPA for improving WCVRP solutions. First, the importance levels of LSSP criteria including the operational cost criterion were determined by using a modified analytical hierarchy process. Then, a multiple criteria greedy heuristic model was proposed to construct WCVRP solutions and to find a new landfill site(s) with the minimum total operational costs. Moreover, the WCVRP solutions were improved by using PPA. Both models were tested on a WCVRP benchmark problem and a case-based scenario in Kubang Pasu, Kedah. Five candidate landfill sites were considered. The results revealed that a single landfill site (Candidate 4) was the best solution for the case-based scenario, with a 6.74% reduction in total distance travelled. As for multiple landfills, Candidates 3 and 4 were the best alternative sites. Nonetheless, different study areas generated different outputs based on the area's geographical conditions. The WCVRP solutions using PPA are comparable with other best-known solutions on the benchmark problem in terms of total distance travelled and the number of vehicles used. The proposed models were cost-effective and may facilitate the SWM authorities in identifying suitable locations for new landfill site(s) and waste vehicle routes. 2023 Thesis https://etd.uum.edu.my/10935/ https://etd.uum.edu.my/10935/1/Depositpermission_s900803.pdf text eng staffonly https://etd.uum.edu.my/10935/2/s900803_01.pdf text eng public other doctoral Universiti Utara Malaysia
institution	Universiti Utara Malaysia
collection	UUM ETD
language	eng eng
advisor	Benjamin, Aida Mauziah Abdul Rahman, Syariza
topic	QA273-280 Probabilities Mathematical statistics
spellingShingle	QA273-280 Probabilities Mathematical statistics Nur Azriati, Mat A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
description	This research focuses on two solid waste management (SWM) problems, particularly the landfill site selection problem (LSSP) and the waste collection vehicle routing problem (WCVRP). Solving LSSP involves the evaluation of multiple criteria to determine the best landfill location. Whereas WCVRP involves, the construction of vehicle routes for collecting waste from customers and discharging their loads at the landfills with the minimum total distance travelled. However, there are two main issues with the existing LSSP and WCVRP models. First, previous models focused only on a single landfill site based on the highest score without considering the operational costs criterion in solving LSSP. Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. Thus, this research proposes a greedy heuristics multiple criteria model which includes operational costs for solving multi-LSSP and develops PPA for improving WCVRP solutions. First, the importance levels of LSSP criteria including the operational cost criterion were determined by using a modified analytical hierarchy process. Then, a multiple criteria greedy heuristic model was proposed to construct WCVRP solutions and to find a new landfill site(s) with the minimum total operational costs. Moreover, the WCVRP solutions were improved by using PPA. Both models were tested on a WCVRP benchmark problem and a case-based scenario in Kubang Pasu, Kedah. Five candidate landfill sites were considered. The results revealed that a single landfill site (Candidate 4) was the best solution for the case-based scenario, with a 6.74% reduction in total distance travelled. As for multiple landfills, Candidates 3 and 4 were the best alternative sites. Nonetheless, different study areas generated different outputs based on the area's geographical conditions. The WCVRP solutions using PPA are comparable with other best-known solutions on the benchmark problem in terms of total distance travelled and the number of vehicles used. The proposed models were cost-effective and may facilitate the SWM authorities in identifying suitable locations for new landfill site(s) and waste vehicle routes.
format	Thesis
qualification_name	other
qualification_level	Doctorate
author	Nur Azriati, Mat
author_facet	Nur Azriati, Mat
author_sort	Nur Azriati, Mat
title	A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
title_short	A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
title_full	A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
title_fullStr	A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
title_full_unstemmed	A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
title_sort	greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions
granting_institution	Universiti Utara Malaysia
granting_department	Awang Had Salleh Graduate School of Arts & Sciences
publishDate	2023
url	https://etd.uum.edu.my/10935/1/Depositpermission_s900803.pdf https://etd.uum.edu.my/10935/2/s900803_01.pdf
_version_	1794023792490577920

A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions

Similar Items