A Clustering-based Simulated Annealing Algorithm with Taguchi Method for the Discrete Ordered Median Problem
Researchers have studied discrete location problems for a long time because of their importance in practice. The Discrete Ordered Median Problem (DOMP) generalizes discrete facility location problems. The DOMP generalizes the main facility location problems' objective functions such as the p-me...
Saved in:
| Main Author: | Mustafa Serdar Toksoy |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sakarya University
2022-02-01
|
| Series: | Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/download/article-file/2125149 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimal cluster head deployment in heterogeneous wireless sensor networks
by: LIU Lin1, et al.
Published: (2010-01-01) -
Book review “Median Archaeology”
by: Reza Mehrafarin
Published: (2017-09-01) -
A Lightweight malware detection technique based on hybrid fuzzy simulated annealing clustering in Android apps
by: Collins Chimeleze, et al.
Published: (2024-12-01) -
On the parameterized complexity of the median and closest problems under some permutation metrics
by: Luís Cunha, et al.
Published: (2024-12-01) -
Ellipsoidal <i>K</i>-Means: An Automatic Clustering Approach for Non-Uniform Data Distributions
by: Alaa E. Abdel-Hakim, et al.
Published: (2024-12-01)