2016
DOI: 10.1016/j.jngse.2016.09.031
|View full text |Cite
|
Sign up to set email alerts
|

Evolutionary memetic algorithms supported by metaheuristic profiling effectively applied to the optimization of discrete routing problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 33 publications
0
4
0
Order By: Relevance
“…The effectiveness of each meme in contributing to a solution is monitored by a metaheuristic profiling technique [36,37], a graphical representation of which is illustrated by Fig. 4 for an optimization solution derived for Case 5C.…”
Section: End Whilementioning
confidence: 99%
See 1 more Smart Citation
“…The effectiveness of each meme in contributing to a solution is monitored by a metaheuristic profiling technique [36,37], a graphical representation of which is illustrated by Fig. 4 for an optimization solution derived for Case 5C.…”
Section: End Whilementioning
confidence: 99%
“…• Allocating records to the tuning, testing and training subsets: ~ 3.5 s • Identifying and ranking squared differences of each tuning and testing subset data record against all data records in the training subset (i.e., more than 9250 data records matched for each tuning and testing subset record) ~ 168 s • Calculating TOB stage 1 predictions: ~ 0.5 s • Executing TOB Stage 2 optimizers (Solver GRG, Solver evolutionary, memetic firefly) to train tuning subsets, consisting of ~ 150 data records, to reach convergence at an RMSE minimum (actual versus predicted PE for all data records in the tuning subsets); or be terminated after a specified running time: [36,37] for the first 110 iterations of the optimizer (Case #5C). The top-ten solutions found by each meme are distinguished top-10 best data matches from the large training subset is the most computationally expensive.…”
Section: Computational Performancementioning
confidence: 99%
“…The effectiveness of each meme in contributing to a solution is monitored by a metaheuristic profiling technique [62,63], a graphical representation of which is illustrated by Fig. 6 for an optimization solution derived for Case#12.…”
Section: Tob Stage 2 (Optimizing the Weights And Number Of Matching Rmentioning
confidence: 99%
“…The obtained detector data formed clones optimized by the CSA and had constant memory, improving classification accuracy and reducing run time [10]. Evolutionary memetic algorithms were effectively applied to optimize discrete routing problems, such as the traveling salesman problem, and involved the use of memetic algorithm, metaheuristic profile, and trajectory-based optimization methods [11][12][13][14][15][16][17][18]. With the integration of machine learning [19][20][21][22][23][24][25][26], evolutionary models can leverage advanced machine learning techniques to enhance their capabilities.…”
Section: Introductionmentioning
confidence: 99%