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

被引：1
|
作者：
da Silva, Carlos Gomes [1 ,2 ]
Climaco, Joao [2 ,3 ]
Almeida Filho, Adiel [4 ]
机构：
[1] Escola Super Tecnol & Gestao Leiria Lena, P-2401951 Alto Vieiro, Leiria, Portugal
[2] INESC Coimbra, P-3000033 Coimbra, Portugal
[3] Univ Coimbra, Fac Econ, P-3004512 Coimbra, Portugal
[4] Univ Fed Pernambuco, BR-50630970 Recife, PE, Brazil
来源：
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2010年 / 8卷 / 02期
关键词：
Networks; Small world measures; {0,1} Multi-objective combinatorial optimization problems; KNAPSACK-PROBLEM; SCATTER SEARCH;
D O I：
10.1007/s10288-009-0110-3
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
下载
收藏
页码：195 / 211
页数：17
相关论文
共 16 条
  • [1] The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem
    Carlos Gomes da Silva
    João Clímaco
    Adiel Almeida Filho
    4OR, 2010, 8 : 195 - 211
  • [2] Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
    Figueira, Jose Rui
    Paquete, Luis
    Simoes, Marco
    Vanderpooten, Daniel
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 56 (01) : 97 - 111
  • [3] Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
    José Rui Figueira
    Luís Paquete
    Marco Simões
    Daniel Vanderpooten
    Computational Optimization and Applications, 2013, 56 : 97 - 111
  • [4] Compressed data structures for bi-objective {0,1}-knapsack problems
    Correia, Pedro
    Paquete, Luis
    Figueira, Jose Rui
    COMPUTERS & OPERATIONS RESEARCH, 2018, 89 : 82 - 93
  • [5] On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem
    Audrey Cerqueus
    Xavier Gandibleux
    Anthony Przybylski
    Frédéric Saubion
    Journal of Heuristics, 2017, 23 : 285 - 319
  • [6] Exact algorithm for bi-objective 0-1 knapsack problem
    Jolai, Fariborz
    Rezaee, M. J.
    Rabbani, M.
    Razmi, J.
    Fattahi, Pariviz
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 194 (02) : 544 - 551
  • [7] On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem
    Cerqueus, Audrey
    Gandibleux, Xavier
    Przybylski, Anthony
    Saubion, Frederic
    JOURNAL OF HEURISTICS, 2017, 23 (05) : 285 - 319
  • [8] Computing and Selecting ε-Efficient Solutions of {0,1}-Knapsack Problems
    Tantar, Emilia
    Schuetze, Oliver
    Figueira, Jose Rui
    Coello, Carlos A. Coello
    Talbi, El-Ghazali
    MULTIPLE CRITERIA DECISION MAKING FOR SUSTAINABLE ENERGY AND TRANSPORTATION SYSTEMS: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON MULTIPLE CRITERIA DECISION MAKING, 2010, 634 : 378 - 388
  • [9] A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem
    Rong, Aiying
    Figueira, Jose Rui
    Pato, Margarida Vaz
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2011, 62 (08) : 2913 - 2930
  • [10] An efficient implementation for the 0-1 multi-objective knapsack problem
    Bazgan, Cristina
    Hugot, Hadrien
    Vanderpooten, Daniel
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2007, 4525 : 406 - +
12