2018
DOI: 10.1016/j.eswa.2017.09.012
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid non-parametric particle swarm optimization and its stability analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 52 publications
0
7
0
Order By: Relevance
“…The most promising method for solving these sorts of problems are dedicated search algorithms based on random strategies [58][59][60] and the projection of the informational bases of biological systems onto computing technologies. The most popular are currently ANN and genetic algorithms; both methods are effective in the field of local strategies and, most importantly, both provide the opportunity of exiting these fields during a global search.…”
Section: Process Operation Designmentioning
confidence: 99%
“…The most promising method for solving these sorts of problems are dedicated search algorithms based on random strategies [58][59][60] and the projection of the informational bases of biological systems onto computing technologies. The most popular are currently ANN and genetic algorithms; both methods are effective in the field of local strategies and, most importantly, both provide the opportunity of exiting these fields during a global search.…”
Section: Process Operation Designmentioning
confidence: 99%
“…Aminbakhsh and Sonmez [17] studied the discrete time-cost trade-off problem by developing a discrete PSO based on the principles for representation, initialization, and position updating of the particles. Liu et al [18] proposed a hybrid non-parametric PSO algorithm for selecting suitable parameters. Operations, including a multi-crossover operation, a vertical crossover, and an exemplar-based learning strategy, were combined to improve the global and the local exploration capabilities.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Equation (15) shows that only one vehicle can travel to shipment point j (excluding the factory, i.e., j = 0) in period t. Equation (16) makes sure that at most, one vehicle can travel from shipment point i (excluding the factory, i.e., i = 0) to one single shipment point in period t. Equation (17) ensures that each vehicle, if dispatched, can only travel starting from the factory (i = 0) in each period. Equation (18) shows that all of the vehicles that travel from the factory (i = 0) will go back to the factory in each period. Equation (19) ensures that if vehicle e travels from shipment point i (excluding the factory, i.e., i = 0) it will travel to only one shipment point j directly in each period.…”
Section: Mixed Integer Programming (Mip)mentioning
confidence: 99%
“…In (ii), the parameters inertia weight [31], [61], acceleration coefficients [12], [27], and random numbers [8], [51] attract much more attention and have become focus of research in the area of PSO in recent years. In (iii), there is no need to tune any algorithmic parameter in PSO by removing all the parameters from the standard particle swarm optimization [6], [29], [37]. In (iv), the whole swarm in PSO can be divided into several sub-swarms during the search process so as to explore different sub-regions of the solution space with different search strategies [11], [20], [35], [70].…”
Section: Introductionmentioning
confidence: 99%