2019
DOI: 10.1016/j.energy.2019.01.087
|View full text |Cite
|
Sign up to set email alerts
|

Enhancing the performance of a parallel nitrogen expansion liquefaction process (NELP) using the multi-objective particle swarm optimization (MOPSO) algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 37 publications
(20 citation statements)
references
References 44 publications
0
20
0
Order By: Relevance
“…Through L 2 and L 3 , the location of k 2 can be also obtained, as is shown in Equation 20. Therefore, according to R, s a (x a , y a ) and s b (x b , y b ), the positions of k 1 and k 2 can be calculated by Equation (19) and Equation (20). If d ab is equal to 2R, there is only one intersection point between communication ranges and its location is ( x a +x b 2 , y a +y b 2 ).…”
Section: A Selection Of Potential Visiting Pointsmentioning
confidence: 99%
See 3 more Smart Citations
“…Through L 2 and L 3 , the location of k 2 can be also obtained, as is shown in Equation 20. Therefore, according to R, s a (x a , y a ) and s b (x b , y b ), the positions of k 1 and k 2 can be calculated by Equation (19) and Equation (20). If d ab is equal to 2R, there is only one intersection point between communication ranges and its location is ( x a +x b 2 , y a +y b 2 ).…”
Section: A Selection Of Potential Visiting Pointsmentioning
confidence: 99%
“…The distribution of node s 1 , s 2 , s 3 and s 4 is shown in Figure 5(a). Firstly, all intersection points (k 1 ∼k 12 ) are calculated by Equation (19) and Equation (20). In the communication range of node s 1 , intersection points with the highest coverage level are k 2 , k 3 , k 4 and k 5 , as is shown in Figure 5(b).…”
Section: A Selection Of Potential Visiting Pointsmentioning
confidence: 99%
See 2 more Smart Citations
“…If the problem space is considered with d dimensions and particles, the ith position particle at the ith position, X i (x i1 , .., x id ), has a velocity of V i = (v i1 , .., v id ). The best performance of each particle in the swarm is P i (p i1 , .., p id ) [37]. Each particle attempts to improve its position, velocity, and distance with respect to the best particle.…”
Section: Multi-objective Particle Swarm Optimization (Mpso)mentioning
confidence: 99%