UUM Electronic Theses and Dissertation
UUM ETD | Universiti Utara Malaysian Electronic Theses and Dissertation
FAQs | Feedback | Search Tips | Sitemap

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

Nur Azriati, Mat (2023) A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions. Doctoral thesis, Universiti Utara Malaysia.

[thumbnail of Depositpermission_s900803.pdf] Text
Restricted to Repository staff only

Download (416kB) | Request a copy
[thumbnail of s900803_01.pdf] Text

Download (13MB)


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.

Item Type: Thesis (Doctoral)
Supervisor : Benjamin, Aida Mauziah and Abdul Rahman, Syariza
Item ID: 10935
Uncontrolled Keywords: Multi-landfill site selection, Waste collection problem, Modified analytical hierarchy process, Greedy heuristics, Plant Propagation Algorithm
Subjects: Q Science > QA Mathematics > QA273-280 Probabilities. Mathematical statistics
Divisions: Awang Had Salleh Graduate School of Arts & Sciences
Date Deposited: 31 Jan 2024 07:41
Last Modified: 31 Jan 2024 07:41
Department: Awang Had Salleh Graduates School of Arts & Sciences
Name: Benjamin, Aida Mauziah and Abdul Rahman, Syariza
URI: https://etd.uum.edu.my/id/eprint/10935

Actions (login required)

View Item
View Item