A novel set-based particle swarm optimization method for discrete optimization problems

IEEE Transactions on Evolutionary Computation

Volumn 14, Issue 2, 2010, Pages 278-300

  Chen, Wei Neng ^a   Zhang, Jun ^a   Chung, Henry S H ^b,c   Zhong, Wen Liang ^d   Wu, Wei Gang ^a   Shi, Yu Hui ^e  

^a SUN YAT SEN UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c eEnergy Technology Limited   (Hong Kong)

^d HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^e XI AN JIAOTONG LIVERPOOL UNIVERSITY   (China)

Author keywords

Combinatorial optimization problem; Discrete space; Multidimensional knapsack problem; Particle swarm optimization; Traveling salesman problem

Indexed keywords

CANDIDATE SOLUTION; COMBINATORIAL OPTIMIZATION PROBLEMS; CONTINUOUS OPTIMIZATION PROBLEMS; CONTINUOUS SPACES; DISCRETE OPTIMIZATION PROBLEMS; DISCRETE SPACES; LOCAL VERSIONS; MULTIDIMENSIONAL KNAPSACK PROBLEM; MULTIDIMENSIONAL KNAPSACK PROBLEMS; PARTICLE SWARM OPTIMIZATION METHOD; REPRESENTATION SCHEMES; SEARCH SPACES;

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; MATHEMATICAL OPERATORS; OPTICAL COMMUNICATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 77950297194     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2009.2030331     Document Type: Article

References (51)

1. J. Kennedy and R. C. Eberhart, "Particle swarm optimization," in Proc. IEEE Int. Conf. Neural Netw., 1995, pp. 1942-1948.
2. Y. Shi and R. C. Eberhart, "A modified particle swarm optimizer," in Proc. IEEE Int. Conf. Evol. Comput., 1998, pp. 69-73.
3. Y. Shi and R. C. Eberhart, "Fuzzy adaptive particle swarm optimization," in Proc. IEEE Int. Conf. Evol. Comput., vol.1. 2001, pp. 101-106.
4. M. Clerc and J. Kennedy, "The particle swarm-explosion, stability and convergence in a multidimensional complex space," IEEE Trans. Evol. Comput., vol.6, no.2, pp. 58-73, Feb. 2002.
5. F. van den Bergh and A. P. Engelbrecht, "A cooperative approach to particle swarm optimization," IEEE Trans. Evol. Comput., vol.8, no.3, pp. 225-239, Jun. 2004.
6. J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, "Comprehensive learning particle swarm optimizer for global optimization of multimodal functions," IEEE Trans. Evol. Comput., vol.10, no.3, pp. 281-295, Jun. 2006.
7. J. Kennedy and R. C. Eberhart, "A discrete binary version of the particle swarm algorithm," in Proc. IEEE Int. Conf. Syst. Man Cybern., 1997, pp. 4104-4109.
8. B. Al-Kazemi and C. K. Mohan, "Discrete multi-phase particle swarm optimization," in Information Processing with Evolutionary Algorithms. Berlin, Germany: Springer, 2006, pp. 306-326.
9. G. Pampara, N. Franken, and A. P. Engelbrecht, "Combining particle swarm optimisation with angle modulation to solve binary problems," in Proc. 2005 IEEE Congr. Evol. Comput., vol.1. pp. 89-96.
10. M. Clerc, "Discrete particle swarm optimization," in New Optimization Techniques in Engineering. New York: Springer-Verlag, 2004.
11. K.-P. Wang, L. Huang, C.-G. Zhou, and W. Pang, "Particle swarm optimization for traveling salesman problem," in Proc. 2nd Int. Conf. Mach. Learning Cybern., 2003, pp. 1583-1585.
12. A. Salman, I. Ahmad, and S. Al-Madani, "Particle swarm optimization for task assignment problem," Microprocessors Microsyst., vol.26, no.8, pp. 363-371, Aug. 2002.
13. D. Y. Sha and C. Hsu, "A hybrid particle swarm optimization for job shop scheduling problem," Comput. Ind. Eng., vol.51, no.4, pp. 791-808, Dec. 2006.
14. W. Pang, K.-P. Wang, C.-G. Zhou, L.-J. Dong, M. Liu, H.-Y. Zhang, and J.-Y. Wang, "Modified particle swarm optimization based on space and transformation for solving traveling salesman problem," in Proc. 3rd Int. Conf. Mach. Learning Cybern., 2004, pp. 2342-2348.
15. W. Pang, K.-P. Wang, C.-G. Zhou, and L.-J. Dong, "Fuzzy discrete particle swarm optimization for solving traveling salesman problem," in Proc. 4th Int. Conf. Comput. Information Technol. (CIT), 2004, pp. 796-800.
16. C.-J. Liao, C.-T. Tseng, and P. Luarn, "A discrete version of particle swarm optimization flowshop scheduling problems," Comput. Operations Res., vol.34, no.10, pp. 3099-3111, Oct. 2007.
17. B. Shen, M. Yao, and W. Yi, "Heuristic information based improved fuzzy discrete PSO method for solving TSP," in Proc. 9th Pacific Rim Int. Conf. Artif. Intell. (PRICAI), 2006, pp. 859-863.
18. Y. Wang, Y. Wanga, X.-Y. Fenga, Y.-X. Huanga, D.-B. Pub, W.-G. Zhoua, Y.-C. Lianga, and C.-G. Zhoua, "A novel quantum swarm evolutionary algorithm and its applications," Neurocomputing, vol.70, nos. 4-6, pp. 633-640, Jan. 2007.
19. F. Afshinmanesh, A. Marandi, and A. Rahimi-Kian, "A novel binary particle swarm optimization method using artificial immune system," in Proc. IEEE Int. Conf. Comput. Tool (EUROCON), 2005, pp. 217-220.
20. X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, and Q. X. Wang, "Particle swarm optimization-based algorithms for TSP and generalized TSP," Inform. Process. Lett., vol.103, no.5, pp. 169-176, Aug. 2007.
21. Y.-X. Jin, H.-Z. Cheng, J.-Y. Yan, and L. Zhang, "New discrete method for particle swarm optimization and its application in transmission network expansion planning," Electr. Power Syst. Res., vol.77, nos. 3-4, pp. 227-233, Mar. 2007.
22. S. Chandrasekaran, S. G. Ponnambalam, R. K. Suresh, and N. Vijayaku-mar, "A hybrid discrete particle swarm optimization algorithm to solve flow shop scheduling problems," in Proc. Int. Conf. Cybern. Intell. Syst., 2006, pp. 1-6.
23. Q.-K. Pan, M. F. Tasgentiren, and Y.-C. Liang, "A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem," Comput. Operations Res., vol.35, no.9, pp. 2807-2839, Sep. 2008.
24. C.-T. Tseng and C.-J. Liao, "A discrete particle swarm optimization for lot-streaming flowshop scheduling problem," Eur. J. Oper. Res., vol.191, no.2, pp. 360-373, Dec. 2008.
25. Z. Lian, X. Gu, and B. Jiao, "A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan," Chaos Solitons Fractals, vol.35, no.5, pp. 851-861, Mar. 2008.
26. H. S. Lopes and L. S. Coelho, "Particle swarm optimization with fast local search for the blind traveling salesman problem," in Proc. 5th Int. Conf. Hybrid Intell. Syst. (HIS), Nov. 2005, pp. 245-250.
27. E. F. G. Goldbarg, G. R. de Souza, and M. C. Goldbarg, "Particle swarm for the traveling salesman problem," in Proc. Conf. Evol. Comput. Combinatorial Optimisation, 2006, pp. 99-110.
28. M. Dorigo and L. M. Gambardella, "Ant colony system: A cooperative learning approach to the traveling salesman problem," IEEE Trans. Evol. Comput., vol.1, no.1, pp. 53-66, Apr. 1997.
29. R. C. Eberhart and Y. Shi, "Particle swarm optimization: Developments, applications and resources," in Proc. IEEE Int. Congr. Evol. Comput., vol.1. 2001, pp. 81-86.
30. J. Kennedy, "Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance," in Proc. 1999 Congr. Evol. Comput. (CEC), vol.3. Washington D.C., 1999, pp. 1931-1938.
31. J. Kennedy and R. Mendes, "Population structure and particle swarm performance," in Proc. 2002 Congr. Evol. Comput. (CEC), vol.2. 2002, pp. 1671-1676.
32. P. C. Chu and J. E. Beasley, "A genetic algorithm for the multidimensional knapsack problem," J. Heuristics, vol.4, no.1, pp. 63-86, Jun. 1998.
33. T. M. Blackwell and P. J. Bentley, "Do not push me! Collision-avoiding swarms," in Proc. Congr. Evol. Comput. (CEC), 2002, pp. 1691-1696.
34. A. Ratnaweera, S. K. Halgamuge, and H.C. Watson, "Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients," IEEE Trans. Evol. Comput., vol.8, no.3, pp. 240-255, Jun. 2004.
35. M. Lovbjerg, T. K. Rasmussen, and T. Krink, "Hybrid particle swarm optimizer with breeding and subpopulations," in Proc. Genetic Evol. Comput. Conf., 2001, pp. 469-476.
36. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Operations Res., vol.21, no.2, pp. 498-516, Mar.-Apr. 1973.
37. G. Reinelt, "TSPLIB: A traveling salesman problem library," Orbit Reconst. Simulation Anal. J. Comput., vol.3, no.4, pp. 376-384, Jan. 1991.
38. W.-L. Zhong, J. Zhang, and W.-N. Chen, "A novel discrete particle swarm optimization to solve traveling salesman problem," in Proc. IEEE Int. Conf. Evol. Comput. (CEC), Singapore, Sep. 2007, pp. 3283-3287.
39. M. Dorigo and T. Stützle, Ant Colony Optimization. Cambridge, MA: MIT Press, 2004.
40. T. Stützle and H. Hoos, "MAX-MIN ant system and local search for the traveling salesman problem," in Proc. IEEE Int. Conf. Evol. Comput. (ICEC), 1997, pp. 309-314.
41. Y. Nagata and S. Kobayashi, "Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem," in Proc. 7th Int. Conf. Genetic Algorithm (ICGA), 1997, pp. 450-457.
42. J. J. Grefenstette, "Incorporating problem specific knowledge into genetic algorithms," in Genetic Algorithms Simulated Annealing, L. Davis, Ed. London, U.K.: Pittman, 1987, ch. 4, pp. 42-60.
43. B. Freisleben and P. Merz, "New genetic local search operators for the traveling salesman problem," in Proc. 4th Parallel Problem Solving Nature (PPSN 4), 1996, pp. 890-899.
44. G. Tao and Z. Michalewicz, "Inver-over operator for the TSP," in Proc. Parallel Problem Solving Nature V (PPSN V), 1998, pp. 803-812.
45. H.-K. Tsai, J.-M. Yang, Y.-F. Tsai, and C.-Y. Kao, "Some issues of designing genetic algorithms for traveling salesman problems," Soft Comput., vol.8, no.10, pp. 689-697, Nov. 2004.
46. G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications. New York: Springer-Verlag, 1994.
47. M. Kong and P. Tian, "Apply the particle swarm optimization to the multidimensional knapsack problem," in Proc. 8th Int. Conf. Artif. Intell. Soft Comput. (ICAISC), LNAI 4029. 2006, pp. 1140-1149.
48. G. Leguizamon and Z. Michalewicz, "A new version of ant system for subset problems," in Proc. Congr. Evol. Comput., vol.2. 1999, pp. 1459-1464.
49. I. Alaya, C. Solnon, and K. Ghéira, "Ant algorithm for the multidimensional knapsack problem," in Proc. Int. Conf. Bio-Inspired Optimization Methods Their Appl. (BIOMA), Oct. 2004, pp. 63-72.
50. S. Findanova, "Evolutionary algorithm for multidimensional knapsack problem," in Proc. 7th Int. Conf. Parallel Problem Solving Nature Workshop, 2002.
51. S. Lin., "Computer solutions of the traveling salesman problem," Bell Syst. J., vol.44, pp. 2245-2269, Dec. 1965.