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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | en |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://etd.uum.edu.my/10144/1/s816980_01.pdf https://etd.uum.edu.my/10144/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1842132601313165312 |
|---|---|
| author | Nurhazwani, Ahmad Razak |
| author_facet | Nurhazwani, Ahmad Razak |
| author_sort | Nurhazwani, Ahmad Razak |
| building | UUM Library |
| collection | Institutional Repository |
| content_provider | Universiti Utara Malaysia |
| content_source | UUM Electronic Theses |
| continent | Asia |
| country | Malaysia |
| 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 |
| id | my.uum.etd-10144 |
| institution | Universiti Utara Malaysia |
| language | en |
| publishDate | 2021 |
| record_format | eprints |
| spelling | my.uum.etd-101442025-08-27T01:28:39Z https://etd.uum.edu.my/10144/ Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem Nurhazwani, Ahmad Razak 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 NonPeerReviewed text en https://etd.uum.edu.my/10144/1/s816980_01.pdf Nurhazwani, Ahmad Razak (2021) Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem. Masters thesis, Universiti Utara Malaysia. |
| spellingShingle | QA Mathematics Nurhazwani, Ahmad Razak Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem |
| title | 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_short | 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 |
| topic | QA Mathematics |
| url | https://etd.uum.edu.my/10144/1/s816980_01.pdf https://etd.uum.edu.my/10144/ |
| url_provider | http://etd.uum.edu.my/ |