Neuroevolution for solving multiobjective knapsack problems

被引:10
|
作者
Denysiuk, Roman [1 ]
Gaspar-Cunha, Antonio [1 ]
Delbem, Alexandre C. B. [2 ]
机构
[1] Univ Minho, IPC, P-4800058 Guimaraes, Portugal
[2] Univ Sao Paulo, Inst Math & Comp Sci, BR-13566590 Sao Carlos, SP, Brazil
关键词
Evolutionary computation; Multiobjective knapsack problem; Neuroevolution; EVOLUTIONARY ALGORITHMS; NEURAL-NETWORKS; DIFFERENTIAL EVOLUTION; GENETIC ALGORITHMS; OPTIMIZATION; PERFORMANCE; RECOMBINATION; OPERATORS; CROSSOVER; SELECTION;
D O I
10.1016/j.eswa.2018.09.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The multiobjective knapsack problem (MOKP) is an important combinatorial problem that arises in various applications, including resource allocation, computer science and finance. When tackling this problem by evolutionary multiobjective optimization algorithms (EMOAs), it has been demonstrated that traditional recombination operators acting on binary solution representations are susceptible to a loss of diversity and poor scalability. To address those issues, we propose to use artificial neural networks for generating solutions by performing a binary classification of items using the information about their profits and weights. As gradient-based learning cannot be used when target values are unknown, neuroevolution is adapted to adjust the neural network parameters. The main contribution of this study resides in developing a solution encoding and genotype-phenotype mapping for EMOAs to solve MOKPs. The proposal is implemented within a state-of-the-art EMOA and benchmarked against traditional variation operators based on binary crossovers. The obtained experimental results indicate a superior performance of the proposed approach. Furthermore, it is advantageous in terms of scalability and can be readily incorporated into different EMOAs. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:65 / 77
页数:13
相关论文
共 50 条
  • [1] MOEA/D with Uniform Design for Solving Multiobjective Knapsack Problems
    Tan, Yan-yan
    Jiao, Yong-chang
    [J]. JOURNAL OF COMPUTERS, 2013, 8 (02) : 302 - 307
  • [2] Approximating multiobjective knapsack problems
    Erlebach, T
    Kellerer, H
    Pferschy, U
    [J]. MANAGEMENT SCIENCE, 2002, 48 (12) : 1603 - 1612
  • [3] Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
    Florios, Kostas
    Mavrotas, George
    Diakoulaki, Danae
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (01) : 14 - 21
  • [4] Solving knapsack problems on GPU
    Boyer, V.
    El Baz, D.
    Elkihel, M.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 42 - 47
  • [5] On Multiobjective Knapsack Problems with Multiple Decision Makers
    Song, Zhen
    Luo, Wenjian
    Lin, Xin
    She, Zeneng
    Zhang, Qingfu
    [J]. 2022 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2022, : 156 - 163
  • [6] A Novel Multiobjective Optimization Algorithm for 0/1 Multiobjective Knapsack Problems
    Chen, Min-Rong
    Weng, Jian
    Li, Xia
    [J]. ICIEA 2010: PROCEEDINGS OF THE 5TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, VOL 3, 2010, : 359 - +
  • [7] SOLVING SEQUENTIAL KNAPSACK-PROBLEMS
    HARTMANN, M
    OLMSTEAD, T
    [J]. OPERATIONS RESEARCH LETTERS, 1993, 13 (04) : 225 - 232
  • [8] Solving irregular rotational knapsack problems
    Martins, T. C.
    Tsuzuki, M. S. G.
    [J]. PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, 2007, : 711 - 716
  • [9] SOLVING MULTIOBJECTIVE TRANSPORTATION PROBLEMS
    DIAZ, JA
    [J]. EKONOMICKO-MATEMATICKY OBZOR, 1978, 14 (03): : 267 - 274
  • [10] Solving multiple knapsack problems by cutting planes
    Ferreira, CE
    Martin, A
    Weismantel, R
    [J]. SIAM JOURNAL ON OPTIMIZATION, 1996, 6 (03) : 858 - 877