Skip to main content
Log in

The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem

  • Research Paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

The small world phenomenon, Milgram (1967) has inspired the study of real networks such as cellular networks, telephone call networks, citation networks, power and neural networks, etc. The present work is about the study of the graphs produced by efficient solutions of the bi-objective {0,1}-knapsack problem. The experiments show that these graphs exhibit properties of small world networks. The importance of the supported and non-supported solutions in the entire efficient graph is investigated. The present research could be useful for developing more effective search strategies in both exact and approximate solution methods of {0,1} multi-objective combinatorial optimization problems.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aghezzaf B, Naimi M (2009) The two-stage recombination operator and its application to the multi-objective 0/1 knapsack problem: a comparative study. Comp Oper Res 36: 3247–3262

    Article  Google Scholar 

  • Albert R, Barabási A (2002) Statistical mechanics of complex networks. Rev Mod Phys 74: 47–97

    Article  Google Scholar 

  • Albert R, Jeong H, Barabási A (1999) Diameter of the world-wide web. Nature 401: 130

    Article  Google Scholar 

  • Amaral L, Scala A, Barthélémy M, Stanley H (2000) Classes of small world networks. Proc Natl Acad Sci 97(21): 11149–11152

    Article  Google Scholar 

  • Bazgan C, Hugot H, Vanderpooten D (2009a) Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. Eur J Oper Res 198(1): 47–56

    Article  Google Scholar 

  • Bazgan C, Hugot H, Vanderpooten D (2009b) Solving efficiently the 0-1 multi-objective knapsack problem. Comp Oper Res 36: 260–279

    Article  Google Scholar 

  • Beier R, Röglin H, Vöcking B (2007) The smoothed number of pareto optimal solutions in bicriteria integer optimization. Lect Notes Comput Sci 4153: 53–67

    Google Scholar 

  • Captivo M, Clímaco J, Figueira J, Martins E, Santos JL (2003) Solving multiple criteria 0,1-knapsack problems using a labeling algorithm. Comp Oper Res 30: 1865–1886

    Article  Google Scholar 

  • Cohon J (1978) Multi-objective programming and planning. Academic Press, London

    Google Scholar 

  • Dorogovtesv S, Mendes F (2003) Evolution of networks—from biology nets to the internet and WWW. Oxford University Press, Oxford

    Google Scholar 

  • Ehrgott M, Klamroth K (1997) Connectedness of efficient solutions in multicriteria combinatorial optimization. Eur J Oper Res 97(1): 159–166

    Article  Google Scholar 

  • Erdös P, Rényi A (1959) On random graph. Publ Math 6: 290–297

    Google Scholar 

  • Gomes da Silva C (2005) Finding the set of non-dominated solutions in the bi-objective 0,1-knapsack: an approach with meta-heuristics and exact methods. PhD thesis, Faculty of Economics, University of Coimbra

  • Gomes da Silva C, Clímaco J (2008) Finding communities in the efficient solutions network. Technical report, Institute for Systems and Computers Engineering, Coimbra, Portugal

  • Gomes da Silva C, Clímaco J, Figueira J (2004) Geometrical configuration of the pareto frontier of bi-criteria 0,1-knapsack problems. Technical report, Institute for Systems and Computers Engineering, Coimbra, Portugal

  • Gomes da Silva C, Clímaco J, Figueira J (2006) A scatter search method dedicated to the bi-objective knapsack problems. Eur J Oper Res 169(2): 373–391

    Article  Google Scholar 

  • Gomes da Silva C, Clímaco J, Figueira J (2008) Core problems in bi-objective 0-1 knapsack problems. Comp Oper Res 35(7): 2292–2306

    Article  Google Scholar 

  • Gomes da Silva C, Figueira J, Clímaco J (2007) Integrating partial optimization with scatter search for solving bi-objective 0,1-knapsack problems. Eur J Oper Res 177: 1656–1677

    Article  Google Scholar 

  • Gorski J, Klamroth K, Ruzika S (2006) Connectedness of efficient solutions in multiple objective combinatorial optimization. Technical report, Department of Mathematics, University of Kaiserslautern

  • Huberman B, Adamic L (2000) Growth dynamics of the world-wide web. Nature 401: 131

    Google Scholar 

  • Klamroth K, Wiecek M (2000) Dynamic programming approaches to the multiple criteria knapsack problem. Nav Res Logist 47(1): 57–76

    Article  Google Scholar 

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

    Google Scholar 

  • Milgram S (1967) The small world problem. Psychol Today 1(1): 60–67

    Google Scholar 

  • Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69: 026113.1–026113.15

    Google Scholar 

  • Ruzika S (2008) On multiple objective combinatorial optimization. PhD thesis, Department of Mathematics, University of Kaisreslautern

  • Steuer R (1986) Multiple criteria optimization, theory, computation and application. Wiley, New York

    Google Scholar 

  • Visée M, Teghem J, Pirlot M, Ulungu E (1998) Two phases method and branch and bound procedures to solve the bi-objective knapsack problem. J Glob Optim 12: 139–155

    Article  Google Scholar 

  • Zhang CW, Ong HL (2004) Solving the biobjective zero-one knapsack problem by an efficient lp-based heuristic. Eur J Oper Res 159: 545–557

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carlos Gomes da Silva.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gomes da Silva, C., Clímaco, J. & Filho, A.A. The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem. 4OR-Q J Oper Res 8, 195–211 (2010). https://doi.org/10.1007/s10288-009-0110-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-009-0110-3

Keywords

MSC classification (2000)

Navigation