Probability increment based swarm optimization for combinatorial optimization with application to printed circuit board assembly. Issue 4 (5th February 2014)

• Record Type: Journal Article
• Authors: Tumer, Irem Y.; Lewis, Kemper; Zeng, Kehan; Tan, Zhen; Dong, Mingchui; Yang, Ping
• Is Part Of: AI EDAM. Volume 28:Issue 4(2014)
• Page Start: 429
• Page End: 437
• Publication Date: 2014-02-05
• Subjects: Engineering design -- Data processing -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; 620.00420285
• DOI: 10.1017/S0890060413000632
• Languages: English
• ISSNs: 0890-0604

Abstract

<abstract abstract-type="normal"> <title>Abstract</title> <p>A novel swarm intelligence approach for combinatorial optimization is proposed, which we call probability increment based swarm optimization (PIBSO). The population evolution mechanism of PIBSO is depicted. Each state in search space has a probability to be chosen. The rule of increasing the probabilities of states is established. Incremental factor is proposed to update probability of a state, and its value is determined by the fitness of the state. It lets the states with better fitness have higher probabilities. Usual roulette wheel selection is employed to select states. Population evolution is impelled by roulette wheel selection and state probability updating. The most distinctive feature of PIBSO is because roulette wheel selection and probability updating produce a trade-off between global and local search; when PIBSO is applied to solve the printed circuit board assembly optimization problem (PCBAOP), it performs superiorly over existing genetic algorithm and adaptive particle swarm optimization on length of tour and CPU running time, respectively. The reason for having such advantages is analyzed in detail. The success of PCBAOP application verifies the effectiveness and efficiency of PIBSO and shows that it is a good method for combinatorial optimization in engineering.</p> </abstract>