2016
DOI: 10.1088/1757-899x/122/1/012011
|View full text |Cite
|
Sign up to set email alerts
|

Greedy heuristic algorithm for solving series of eee components classification problems*

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…Since the MCLP was suggested by Church and ReVelle in 1973 [5], many models and methodologies were proposed to achieve MCLP that applied in various sectors to cover area and determine the best location facilities [2]. Such that, [6] used the agglomerative greedy heuristics with genetic algorithms to solve the p-median clustering problem. Moreover, the MCLP was represented as numbering system that has been have ability to represent in computer software [5].…”
Section: An Overview Of Covering Area Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…Since the MCLP was suggested by Church and ReVelle in 1973 [5], many models and methodologies were proposed to achieve MCLP that applied in various sectors to cover area and determine the best location facilities [2]. Such that, [6] used the agglomerative greedy heuristics with genetic algorithms to solve the p-median clustering problem. Moreover, the MCLP was represented as numbering system that has been have ability to represent in computer software [5].…”
Section: An Overview Of Covering Area Problemmentioning
confidence: 99%
“…Dataset representation and collection: the dataset in consistence of the results of [4] and the collected data from different resources (point 3 and 4) will be represented in Arc-GIS database. 6. System description and applying: At this point, the procedures, variables, and facts are ready to apply in Arc-GIS.…”
Section: Linked the Research Decision Effective Factors From [4] Andmentioning
confidence: 99%
“…This searching process reduces the time requirement substantially. Problem-specific properties [36] and greedy approaches [29] are often used for subset selection. Meta-heuristic algorithms [13,16,44] are used to overcome heuristic algorithms' inability to circumvent local optima and are applicable to a wide range of problems.…”
Section: Introductionmentioning
confidence: 99%