Skip to main content
SpringerLink
Log in

Essential Particle Swarm Optimization queen with Tabu Search for MKP resolution

  • Published:
Computing Aims and scope Submit manuscript

Abstract

The Particle Swarm Optimization (PSO) algorithm is an innovative and promising optimization technique in evolutionary computation. The Essential Particle Swarm Optimization queen (EPSOq) is one of the recent discrete PSO versions that further simplifies the PSO principles and improves its optimization ability. Hybridization is a principle of combining two (or more) approaches in a wise way such that the resulting algorithm includes the positive features of both (or all) the algorithms. This paper proposes a new heuristic approach such that various features inspired from the Tabu Search are incorporated in the EPSOq algorithm in order to obtain another improved discrete PSO version. The implementation of this idea is identified with the acronym TEPSOq (Tabu Essential Particle Swarm Optimization queen). Experimentally, this approach is able to solve optimally large-scale strongly correlated 0–1 Multidimensional Knapsack Problem (MKP) instances. Computational results show that TEPSOq has outperforms not only the EPSOq, but also other existing PSO-based approaches and some other meta-heuristics in solving the 0–1 MKP. It was discovered also that this algorithm is able to locate solutions extremely close and even equal to the best known results available in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Abido AM (2002) Optimal power flow using particle swarm optimization. Electr Power Energy Syst 24(7):563–571

    Article  Google Scholar 

  2. Brandstatter B, Baumgartner U (2002) Particle swarm optimization. Mass-spring system analogon. IEEE Trans Magn 38(2):997–1000

    Article  Google Scholar 

  3. Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363–371

    Article  Google Scholar 

  4. Wachowiak M, Smolikova R, Zheng Y, Zurada J, Elmaghraby A (2004) An approach to multimodal biomedical image registration utilizing particle swarm optimization. IEEE Trans Evol Comput 8(3):289–301

    Article  Google Scholar 

  5. Blackwell T, Bentley PJ (2002) Improvised music with swarms. In: Fogel DB, El-Sharkawi MA, Yao X, Greenwood G, Iba H, Marrow P, Shackleton M (eds) Proceedings of the 2002 Congress on Evolutionary Computation CEC 2002. IEEE Press, pp 1462–1467

  6. Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Morgan Kaufmann Publishers, San Francisco

    Google Scholar 

  7. Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the 6th International Symposium on Micro Machine and Human Science, pp 39–43

  8. Kennedy J, Eberhart RC (1995) Particle swarm optimisation. In: Proceedings of the IEEE International Conference, pp 942–948

  9. Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE International Conference on Systems, Man, and, Cybernetics, pp 4104–4109

  10. Luh GC, Lin CY, Lin YS (2011) A binary particle swarm optimization for continuum structural topology optimization. Appl Soft Comput 11:2833–2844

    Article  Google Scholar 

  11. Chen E, Li J, Liuc X (2011) In search of the essential binary discrete particle swarm. Appl Soft Comput 11(3):3260–3269

    Article  Google Scholar 

  12. Chu P, Beasley J (1998) A genetic algorithm for the multidimensional Knapsack problem. J Heuristics 4:63–86

    Article  MATH  Google Scholar 

  13. Martello S, Toth P (1990) Knapsack problems, algorithms and computer implementations. Wiley, New York

    MATH  Google Scholar 

  14. OR-Library, Beasley JE. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/

  15. Angelelli E, Speranza MG, Savelsbergh MWP (2007) Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4):308–317

    Article  MathSciNet  MATH  Google Scholar 

  16. Vasquez M, Vimont Y (2005) Improved results on the 0–1 multidimensional Knapsack problem. Eur J Oper Res 165:70–81

    Article  MathSciNet  MATH  Google Scholar 

  17. Weingartner HM, Ness DN (1967) Methods for the solution of the multidimensional 0/1 Knapsack problem. Oper Res 15(1):83–103

    Article  Google Scholar 

  18. Fayard D, Plateau G (1982) An algorithm for the solution of the 0–1 Knapsack problem. Computing 28:269–287

    Article  MATH  Google Scholar 

  19. Lorie JH, Savage LJ (1955) Three problems in capital rationing. J Bus 28:229–239

    Article  Google Scholar 

  20. Meier H, Christofides N, Salkin G (2001) Capital budgeting under uncertainty: an integrated approach using contingent claims analysis and integer programming. Oper Res 49(2):196–206

    Article  MATH  Google Scholar 

  21. Gilmore PC, Gomory RE (1966) The theory and computation of Knapsack functions. Operat Res 14(6):1045–1075

    Article  MathSciNet  Google Scholar 

  22. Shih W (1979) A branch and bound method for the multiconstraint zero–one Knapsack problem. J Oper Res Soc 39:369–378

    Google Scholar 

  23. Gavish B, Pirkul H (1982) Allocation of databases and processors. In: Akola DJ (ed) A distributed data processing. Management of Distributed Data Processing, North-Holland, pp 215–231

    Google Scholar 

  24. Vasquez M, Hao JK (2001) A logic-constrained Knapsack formulation and a Tabu algorithm for the daily photograph scheduling of an Earth observation satellite. Comput Optim Appl 20(2):137–157

    Article  MathSciNet  MATH  Google Scholar 

  25. Gavish B, Pirkul H (1985) Efficient algorithms for solving multiconstraint zero–one Knapsack problems to optimality. Math Program 31:78–105

    Article  MathSciNet  MATH  Google Scholar 

  26. Balas E, Martin CH (1980) Pivot and complement-A heuristic for 0–1 programming. Manag Sci 26:86–96

    Article  MathSciNet  MATH  Google Scholar 

  27. Bronstein IN, Semendjajew KA (1991) Taschenbuch der Mathematik. B. G, Teubner, Leipzig

    Google Scholar 

  28. Magazine MJ, Oguz D (1984) A heuristic algorithm for the multidimensional zero–one Knapsack problem. Eur J Oper Res 16:319–326

    Article  MathSciNet  MATH  Google Scholar 

  29. Martello S, Toth P (1990) Knapsack problems. Algorithms and computer implementations. Wiley, New York

    MATH  Google Scholar 

  30. Pirkul H (1987) A heuristic solution procedure for the multiconstrained zero–one Knapsack problem. Nav Res Logist 34:161–172

    Article  MATH  Google Scholar 

  31. Volgenant A, Zoon JA (1990) An improved heuristic for multidimensional 0–1 Knapsack problems. J Operat Res Soc 41:963–970

    Google Scholar 

  32. Chu PC (1997) A genetic algorithm approach for combinatorial optimization problems. Ph.D. thesis, The Management School, Imperial College of Science, London

  33. Chu PC, Beasley JE (1997) A genetic algorithm for the multidimensional Knapsack problem. Working paper, The Management School, Imperial College of Science, London

  34. Hanafi S, Fréville A (1998) An efficient Tabu search approach for the 0–1 multidimensional Knapsack problem. Eur J Oper Res 106(2):659–675

    Article  MATH  Google Scholar 

  35. Alonso CL, Caro F, Montana JL (2005) An evolutionary strategy for the multidimensional 0–1 Knapsack problem based on genetic computation of surrogate multipliers. In: Mira J, Alvarez JR (eds) IWINAC 2005. LNCS vol 3562, pp 63–73

  36. Drexl A (1988) A simulated annealing approach to the multiconstraint zero–one Knapsack problem. Computing 40:1–8

    Article  MathSciNet  MATH  Google Scholar 

  37. Fidanova S (2005) Ant colony optimization for multiple Knapsack problem and model. In: Li BZ et al (eds) NAA 2004. LNCS vol 3401, pp 280–287

  38. Li H, Jiao YC, Zhang L, Gu ZW (2006) Genetic algorithm based on the orthogonal design for multidimensional Knapsack problems. In: Jiao L et al (eds) ICNC 2006. Part I, LNCS vol 4221, pp 696–705

  39. Zhou Y, Kuang Z, Wang J (2008) A chaotic neural network combined heuristic strategy for multidimensional Knapsack problem. In: Kang L et al (eds) ISICA 2008. LNCS vol 5370, pp 715–722

  40. Angelelli E, Mansini R, Speranza MG (2010) Kernel search: a general heuristic for the multi-dimensional Knapsack problem. Comput Oper Res 37:2017–2026

    Article  MathSciNet  MATH  Google Scholar 

  41. Kong M, Tian P (2006) Apply the particle swarm optimization to the multidimensional Knapsack problem. In: Rutkowski L et al (eds) ICAISC 2006. LNAI vol 4029, pp 1140–1149

  42. Wang L, Wang X, Fu J (2008) A novel probability binary particle swarm optimization algorithm and its application. J Softw 3:28–35

    Google Scholar 

  43. Wan NF (2008) The particle swarm optimisation algorithm and the 0–1 Knapsack problem. MSc thesis, Nottingham Trent University, Nottingham

  44. Chen WN, Zhang J, Chung HSH, Zhong WL, Wu WG, Shi Yh (2010) A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput 14:278–300

    Article  Google Scholar 

  45. Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part I: background and development. Nat Comput 6(4):467–484

    Article  MathSciNet  MATH  Google Scholar 

  46. Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization and indicative applications. Nat Comput 7(1):109–124

    Article  MathSciNet  Google Scholar 

  47. Shen Q, Jiang JH, Jiao CX, Shen GL, Yu RQ (2004) Modified particle swarm optimization algorithm for variable selection in MLR And PLS modeling. QSAR studies of antagonism of angiotensin II antagonists. Eur J Pharm Sci 22(2–3):145–152

    Article  Google Scholar 

  48. Wang L, Wang X, Fu J, Zhen L (2008) A novel probability binary particle swarm optimization algorithm and its application. J Softw 3(9):28–35

    Google Scholar 

  49. Lee S, Soak S, Oh S, Pedrycz W, Jeon M (2008) Modified binary particle swarm optimization. Prog Nat Sci 18(9):1161–1166

    Article  MathSciNet  Google Scholar 

  50. Pan QK, Tasgetiren MF, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807–2839

    Article  MathSciNet  MATH  Google Scholar 

  51. Angeline PJ (1998) Evolutionary optimization versus particle swarm optimization: philosophy and performance difference. In: Proceedings of the Evolutionary Programming Conference, San Diego, pp 601–610

  52. Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization: an overview. Swarm Intell 1(1):33–57

    Article  Google Scholar 

  53. Dorigo M, Stützle T (2004) Ant Colony Optim. The MIT Press, Cambridge

    Google Scholar 

  54. Robinson J, Sinton S, Samii YR (2002) Particle swarm, genetic algorithm, and their hybrids: optimization of a profiled corrugated horn antenna. In: Proceedings of the IEEE International Symposium in Antennas and Propagation Society, pp 314–317

  55. Talbi H, Batouche M (2004) Hybrid particle swarm with differential evolution for multimodal image registration. Proc IEEE Int Conf Ind Technol 3:1567–1573

    Google Scholar 

  56. Faigle U, Kern W (1992) Some convergence results for probabilistic Tabu search. ORSA J Comput 4:32–37

    Article  MATH  Google Scholar 

  57. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13:533–549

    Article  MathSciNet  MATH  Google Scholar 

  58. Hansen P (1986) The steepest ascent mildest descent heuristic for combinatorial programming. Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri

    Google Scholar 

  59. Glover F (1989) Tabu search. Part I—ORSA J Comput 1:190–206

    MathSciNet  MATH  Google Scholar 

  60. Friden C, Hertz A, de Werra D (1989) STABULUS: a technique for finding stable sets in large graphs with Tabu search. Computing 42:35–44

    Article  MATH  Google Scholar 

  61. Glover F (1990) Tabu search. Part II—ORSA J Comput 2:4–32

    MATH  Google Scholar 

  62. de Werra D, Hertz A (1989) Tabu search techniques: a tutorial and an application to neural networks. OR Spektrum 11:131–141

    Article  MATH  Google Scholar 

  63. Nanobe K, Ibaraki T (1998) A Tabu search approach to the constrained satisfaction problem as a general problem solver. Eur J Oper Res 106:599–623

    Article  Google Scholar 

  64. http://clerc.maurice.free.fr/pso/

  65. http://clerc.maurice.free.fr/pso/binary_pso/simpleBinaryPSO_C.zip

  66. Leguizamon G, Michalewicz Z (1999) A new version of ant system for subset problems. Proc Congr Evol Comput 2:1459–1464

    Google Scholar 

  67. Alaya I, Solnon C, Ghéira K (2004) Ant algorithm for the multidimensional knapsack problem. In: Proceedings of the International Conference on Bio-Inspired Optimization Methods Their Application, pp 63–72

  68. Puchinger J, Raidl GR, Pferschy U (2010) The multidimensional Knapsack problem: structure and algorithms. INFORMS J Comput 22:250–265

    Article  MathSciNet  MATH  Google Scholar 

  69. Raidl GR (1998) An improved genetic algorithm for the multiconstrained 0–1 knapsack problem. In: Proceedings of the 5th IEEE International Conference on Evolutionary Computation, pp 207–211

  70. Gottlieb J (1999) On the effectivity of evolutionary algorithms for multidimensional knapsack problems. In: Proceedings of Artificial Evolution: Fourth European Conference, LNCS vol 1829, pp 22–37

  71. Raidl GR, Gottlieb J (2005) Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem. Evol Comput J 13:441–475

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the referees for useful comments, which help to improve the paper.

Author information

Authors and Affiliations

  1. L.O.G.I.Q. Research unit, Sfax University, Rte Mharza km 1,5, 3018 , Sfax, Tunisia

    Raida Ktari & Habib Chabchoub

Authors
  1. Raida Ktari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Habib Chabchoub
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raida Ktari.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ktari, R., Chabchoub, H. Essential Particle Swarm Optimization queen with Tabu Search for MKP resolution. Computing 95, 897–921 (2013). https://doi.org/10.1007/s00607-013-0316-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-013-0316-2

Keywords

Mathematics Subject Classification

Search

Navigation