2022
DOI: 10.12928/ijio.v3i1.5862
|View full text |Cite
|
Sign up to set email alerts
|

An estimation of distribution algorithm for combinatorial optimization problems

Abstract: This paper considers solving more than one combinatorial problem considered some of the most difficult to solve in the combinatorial optimization field, such as the job shop scheduling problem (JSSP), the vehicle routing problem with time windows (VRPTW), and the quay crane scheduling problem (QCSP). A hybrid metaheuristic algorithm that integrates the Mallows model and the Moth-flame algorithm solves these problems. Through an exponential function, the Mallows model emulates the solution space distribution fo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Common metaheuristic techniques described in the literature include GAs [43], particle swarm optimization [44], firefly optimization [45], and more [46]- [48]. Among these, the GA has emerged as a popular intelligent search method owing to its straightforward implementation logic and robust capacity for exploring high-dimensional search spaces to find globally optimal solutions [49], [50], [59], [51]- [58]. By mimicking the natural selection processes, GAs can efficiently navigate complex search spaces and identify competitive solutions.…”
Section: Solution Approach-based Genetic Algorithmmentioning
confidence: 99%
“…Common metaheuristic techniques described in the literature include GAs [43], particle swarm optimization [44], firefly optimization [45], and more [46]- [48]. Among these, the GA has emerged as a popular intelligent search method owing to its straightforward implementation logic and robust capacity for exploring high-dimensional search spaces to find globally optimal solutions [49], [50], [59], [51]- [58]. By mimicking the natural selection processes, GAs can efficiently navigate complex search spaces and identify competitive solutions.…”
Section: Solution Approach-based Genetic Algorithmmentioning
confidence: 99%