Nearest Neighbor Interaction PSO Based on Small-World Model

Cui, Zhihua; Chu, Yongfang

doi:10.1007/978-3-642-04394-9_77

Cited by 7 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chen et al [15] pointed out that different values of the spread probability parameters will affect the quick searching feature of small-world network. A smallworld topology structure was applied in PSO by Cui et al [16] to observe the behavior of swarm. This method has made PSO more efficient than before.…”

Section: Introductionmentioning

confidence: 99%

Small-World Optimization Algorithm and Its Application in a Sequencing Problem of Painted Body Storage in a Car Company

Tian

Shao

Zhu

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In the car company, the painted body storage (PBS) is set up between the paint shop and the assembly shop. It stores the vehicles in production and reorders the vehicles sequence. To improve production efficiency of assembly shop, a mathematical model is developed aiming at minimizing the consumption rate of options and the total overtime and idle time. As the PBS sequencing process contains upstream sequence inbound and downstream sequence outbound, this paper proposes an algorithm with two phases. In the first phase, the discrete small-world optimization algorithm (DSWOA) is applied to schedule the inbound sequence by employing the short-range nodes and the long-range nodes in order to realize the global searching. In the second phase, the heuristic algorithm is applied to schedule the outbound sequencing. The proposed model and algorithm are applied in an automobile enterprise. The results indicate that the two-phase algorithm is suitable for the PBS sequencing problem and the DSWOA has a better searching performance than GA in this problem. The sensitivity of model parameters is analyzed as well.

show abstract

Section: Introductionmentioning

confidence: 99%