2017
DOI: 10.1063/1.4994433
|View full text |Cite
|
Sign up to set email alerts
|

Particle swarm optimization – Genetic algorithm (PSOGA) on linear transportation problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
8
0
1

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
2
2

Relationship

3
4

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 5 publications
0
8
0
1
Order By: Relevance
“…In equation (3), the number of available workers is the function of previous period workers, hired worker, and fired worker. In equation (4), the number of current inventory is the function previous period inventory, the number of units produced, and the current demand…”
Section: Mathematical Model Of Production Planningmentioning
confidence: 99%
See 1 more Smart Citation
“…In equation (3), the number of available workers is the function of previous period workers, hired worker, and fired worker. In equation (4), the number of current inventory is the function previous period inventory, the number of units produced, and the current demand…”
Section: Mathematical Model Of Production Planningmentioning
confidence: 99%
“…Production planning model is linear integer programming model with constraints : production, worker, and inventory. Linear integer programming as optimization problem can be solved by exact method like branch and bound, cutting plane [1][2] or heuristic method like Genetic Algorithm (GA) [3], Particle Swarm Optimization (PSO) [4], Artificial Bee Colony (ABC) [5], Firefly Algorithm (FA) [6].…”
mentioning
confidence: 99%
“…Linear programming as optimization problem can be solved by exact method like simplex method and if the solutions are integer then branch and bound and cutting plane method are required [5], [6]. Heuristic methods like Genetic Algorithm (GA) [1], Particle Swarm Optimization (PSO) [7], [8], [9], [10], Artificial Bee Colony (ABC) [11], Firefly Algorithm (FA) [2], Simulated Annealing [12] have applied in many linear programming problem. In constrained optimization using heuristic methods, approaching of new solution must satisfy the given constraints.…”
mentioning
confidence: 99%
“…In constrained optimization using heuristic methods, approaching of new solution must satisfy the given constraints. The satisfication of constraints can be done by modified new solution [7], penalty technique [9], or goal programming [13].…”
mentioning
confidence: 99%
See 1 more Smart Citation