2019
DOI: 10.1007/s00521-019-04656-1
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid algorithm using particle swarm optimization for solving transportation problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 38 publications
0
11
0
Order By: Relevance
“…where ω is inertia weight; c1 and c2 are positive constants known as acceleration coefficients; r1 and r2 are two random variables with a uniform distribution between zero and one [11][12][13][14][15]. Thus, PSO accelerates each particle towards its PBest and GBest locations with randomly weighted accelerations at each step [16,17]. The calculation of this method starts with calculating the distance between the points of the sacred graves and the centers of micro and medium enterprises.…”
Section: Discussionmentioning
confidence: 99%
“…where ω is inertia weight; c1 and c2 are positive constants known as acceleration coefficients; r1 and r2 are two random variables with a uniform distribution between zero and one [11][12][13][14][15]. Thus, PSO accelerates each particle towards its PBest and GBest locations with randomly weighted accelerations at each step [16,17]. The calculation of this method starts with calculating the distance between the points of the sacred graves and the centers of micro and medium enterprises.…”
Section: Discussionmentioning
confidence: 99%
“…Searching on PSO continues until the specified number of iterations is achieved or the optimum error value is reached. 31,32 Each particle has its speed in PSO and increases this speed compared to the particle that is better than it. In each iteration, this speed is recalculated using the best results.…”
Section: Psomentioning
confidence: 99%
“…It is called global best or gbest. Searching on PSO continues until the specified number of iterations is achieved or the optimum error value is reached 31,32 …”
Section: The Control Strategymentioning
confidence: 99%
“…Jordehi and Jasni [27] have reviewed these encoding/decoding techniques which keep the solution particles in the feasible solution space. Recently, Singh & Singh [28] has hybridized PSO to solve TP and resolved this issue by incorporating additional modules into the basic PSO. Thus, in this paper, a similar approach has been adopted to solve the time-minimization transportation problem.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%