2021
DOI: 10.1007/s00607-021-01004-x
|View full text |Cite
|
Sign up to set email alerts
|

A symbiosis between population based incremental learning and LP-relaxation based parallel genetic algorithm for solving integer linear programming models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…The genetic algorithm (GA) is an effective domain-independent search technique that was motivated by Darwin’s idea . Because the GA is population-based, a different answer is produced in each iteration . The main concept of this natural selection algorithm is that stronger people survive and pass on their strong characteristics to their children .…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The genetic algorithm (GA) is an effective domain-independent search technique that was motivated by Darwin’s idea . Because the GA is population-based, a different answer is produced in each iteration . The main concept of this natural selection algorithm is that stronger people survive and pass on their strong characteristics to their children .…”
Section: Methodsmentioning
confidence: 99%
“… 53 Because the GA is population-based, a different answer is produced in each iteration. 54 The main concept of this natural selection algorithm is that stronger people survive and pass on their strong characteristics to their children. 55 This algorithm has two genetic operators: integration and mutation.…”
Section: Methodsmentioning
confidence: 99%
“…Step 1. For each combination of even numbers λ 1 , λ 2 , λ 3 ∈ N + with λ 1 + λ 2 + λ 3 = 100 (1176 ILP combinations), solve (with Mathematica v12.1) the ILP problem with Equation ( 9) as the objective function, using the restrictions of Equations ( 2)- (8). Solve the same problem but with λ 1 = λ 2 = λ 3 = 100/3 (the same weight for all three objective functions).…”
Section: Mathematical Modelmentioning
confidence: 99%
“…To solve a MOILP problem, scalarization methods, which, as their name indicates, turn such a problem into solving single-objective integer linear programming problems, play a crucial role in finding all or a subset of the non-dominated objective vectors. Note that a single-objective integer linear programming problem is known in the literature as an integer linear programming (ILP) problem [6][7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, a more efficient optimisation strategy named artificial bee colony algorithm which is developed by Karaboga [24,25] is introduced. It is based on simulating the foraging behaviour of honey bee swarm, and the numerical comparisons demonstrated that the performance of ABC algorithm is competitive to other population-based algorithms with an advantage of employing fewer control parameters [26,27]. For overcoming the disadvantage of easily getting trapped in the local optimal when solving complex multimodal problems [28], different from combining it with other algorithms [29,30], an improved bee colony algorithm where the search is guided with the important indices of sub-region is proposed.…”
Section: Introductionmentioning
confidence: 99%