Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem

Capacitated Multi-source Weber Problem (CMSWP) is a type of Location Allocation Problem (LAP) which have been extensively researched because they can be applied in a variety of contexts. Random selection of facility location in a Cell-based approach may cause infeasible or worse solutions. This is d...

Full description

Saved in:

Bibliographic Details
Main Author:	Nurhazwani, Ahmad Razak
Format:	Thesis
Language:	eng eng
Published:	2021
Subjects:	QA Mathematics
Online Access:	https://etd.uum.edu.my/10144/1/s816980_01.pdf https://etd.uum.edu.my/10144/2/s816980_02.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uum-etd.10144
record_format	uketd_dc
spelling	my-uum-etd.101442022-12-14T08:26:21Z Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem 2021 Nurhazwani, Ahmad Razak Abdul Rahman, Syariza Benjamin, Aida Mauziah Awang Had Salleh Graduate School of Arts & Sciences Awang Had Salleh Graduate School of Art & Sciences QA Mathematics Capacitated Multi-source Weber Problem (CMSWP) is a type of Location Allocation Problem (LAP) which have been extensively researched because they can be applied in a variety of contexts. Random selection of facility location in a Cell-based approach may cause infeasible or worse solutions. This is due to the unprofitable cells are not excluded and maybe selected for locating facilities. As a result, the total transportation cost increases, and solution quality is not much improved. This research finds the location of facilities in a continuous space to meet the demand of customers which minimize the total cost using Enhanced Cell-based Algorithm (ECBA). This method was derived from previous study that divides the distribution of customers into smaller cells of promising locations. The methodology consists of three phases. First, the profitable cells were constructed by applying ECBA. Second, initial facility configuration was determined using fixed and dynamic radius. Third, Alternating Transportation Problem (ATL) was applied to find a new location. The algorithm was tested on a dataset of three sizes which are 50, 654 and 1060 customers. The computational results of the algorithm prove that the results are superior in terms of total distance compared to the result of previous studies. This study provides useful knowledge to other researchers to find strategic facilities locations by considering their capacities. 2021 Thesis https://etd.uum.edu.my/10144/ https://etd.uum.edu.my/10144/1/s816980_01.pdf text eng 2024-08-05 staffonly https://etd.uum.edu.my/10144/2/s816980_02.pdf text eng public other masters Universiti Utara Malaysia
institution	Universiti Utara Malaysia
collection	UUM ETD
language	eng eng
advisor	Abdul Rahman, Syariza Benjamin, Aida Mauziah
topic	QA Mathematics
spellingShingle	QA Mathematics Nurhazwani, Ahmad Razak Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
description	Capacitated Multi-source Weber Problem (CMSWP) is a type of Location Allocation Problem (LAP) which have been extensively researched because they can be applied in a variety of contexts. Random selection of facility location in a Cell-based approach may cause infeasible or worse solutions. This is due to the unprofitable cells are not excluded and maybe selected for locating facilities. As a result, the total transportation cost increases, and solution quality is not much improved. This research finds the location of facilities in a continuous space to meet the demand of customers which minimize the total cost using Enhanced Cell-based Algorithm (ECBA). This method was derived from previous study that divides the distribution of customers into smaller cells of promising locations. The methodology consists of three phases. First, the profitable cells were constructed by applying ECBA. Second, initial facility configuration was determined using fixed and dynamic radius. Third, Alternating Transportation Problem (ATL) was applied to find a new location. The algorithm was tested on a dataset of three sizes which are 50, 654 and 1060 customers. The computational results of the algorithm prove that the results are superior in terms of total distance compared to the result of previous studies. This study provides useful knowledge to other researchers to find strategic facilities locations by considering their capacities.
format	Thesis
qualification_name	other
qualification_level	Master's degree
author	Nurhazwani, Ahmad Razak
author_facet	Nurhazwani, Ahmad Razak
author_sort	Nurhazwani, Ahmad Razak
title	Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
title_short	Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
title_full	Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
title_fullStr	Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
title_full_unstemmed	Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
title_sort	enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
granting_institution	Universiti Utara Malaysia
granting_department	Awang Had Salleh Graduate School of Arts & Sciences
publishDate	2021
url	https://etd.uum.edu.my/10144/1/s816980_01.pdf https://etd.uum.edu.my/10144/2/s816980_02.pdf
_version_	1776103751232258048

Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem

Similar Items