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: | Nurhazwani, Ahmad Razak |
---|---|
Format: | Thesis |
Language: | eng eng |
Published: |
2021
|
Subjects: | |
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!
|
Similar Items
-
Reactive tabu search approach for solving capacitated arc routing problem
by: Md Yunos, Norhazwani
Published: (2009) -
Investigation of evolutionary multi-objective algorithms in solving view selection problem /
by: Talebian, Seyed Hamid
Published: (2013) -
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem
by: Pang, Li Sim
Published: (2010) -
Performance in enhancement of microfluidic-based capacitive pressure sensor
by: Muhammad Rashidi Ab Razak
Published: (2020) -
Metaheuristic algorithms for solving lot-sizing and scheduling problems in single and multi-plant environments /
by: Mohammadi, Maryam
Published: (2015)