Solving efficiently the 0-1 multi-objective knapsack problem

被引：95
|
作者：
Bazgan, Cristina [1 ]
Hugot, Hadrien [1 ]
Vanderpooten, Daniel [1 ]
机构：
[1] Univ Paris 09, LAMSADE, F-75775 Paris 16, France
来源：
COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 01期
关键词：
Multi-objective knapsack problem; Non-dominated criterion vectors; Efficient solutions; Dynamic programming; Dominance relations; Combinatorial optimization; COMBINATORIAL OPTIMIZATION; SCATTER SEARCH;
D O I：
10.1016/j.cor.2007.09.009
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we present an approach, based on dynamic programming, for solving the 0-1 multi-objective knapsack problem. The main idea of the approach relies on the use of several complementary dominance relations to discard partial solutions that cannot lead to new non-dominated criterion vectors. This way, we obtain an efficient method that outperforms the existing methods both in terms of CPU time and size of solved instances. Extensive numerical experiments on various types of instances are reported. A comparison with other exact methods is also performed. In addition, for the first time to our knowledge, we present experiments in the three-objective case. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码：260 / 279
页数：20
相关论文
共 50 条
  • [1] An efficient implementation for the 0-1 multi-objective knapsack problem
    Bazgan, Cristina
    Hugot, Hadrien
    Vanderpooten, Daniel
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2007, 4525 : 406 - +
  • [2] A practical efficient fptas for the 0-1 multi-objective knapsack problem
    Bazgan, Cristina
    Hugot, Hadrien
    Vanderpooten, Daniel
    ALGORITHMS - ESA 2007, PROCEEDINGS, 2007, 4698 : 717 - +
  • [3] Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
    Bazgan, Cristina
    Hugot, Hadrien
    Vanderpooten, Daniel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 198 (01) : 47 - 56
  • [4] Ant search algorithm for multi-objective 0-1 knapsack problem
    Ma, L
    Yao, J
    Cui, XL
    PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 2598 - 2601
  • [5] Solving the 0-1 Multi-objective Knapsack Problem Using Self-assembly of DNA Tiles
    Cheng, Zhen
    Huang, Yufang
    Chen, Zhihua
    Zhang, Xuncai
    Xu, Jin
    2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS, 2009, : 137 - +
  • [6] ON THE DIETRICH-ESCUDERO APPROACH FOR SOLVING THE 0-1 KNAPSACK-PROBLEM WITH A 0-1 OBJECTIVE FUNCTION
    ESCUDERO, LF
    PEREZ, G
    GARIN, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 73 (01) : 167 - 168
  • [7] An intelligent multi-colony multi-objective ant colony optimization (ACO) for the 0-1 knapsack problem
    Chaharsooghi, S. K.
    Kermani, Amir H. Meimand
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1195 - +
  • [8] An new algorithm of solving 0-1 knapsack problem
    Tuo Shou-Heng
    2011 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER SCIENCE AND APPLICATION (FCSA 2011), VOL 1, 2011, : 543 - 546
  • [9] Memetic Algorithm for Solving the 0-1 Multidimensional Knapsack Problem
    Rezoug, Abdellah
    Boughaci, Dalila
    Badr-El-Den, Mohamed
    PROGRESS IN ARTIFICIAL INTELLIGENCE-BK, 2015, 9273 : 298 - 304
  • [10] SOLVING THE 0-1 PROPORTIONAL KNAPSACK-PROBLEM BY SAMPLING
    PENN, M
    HASSON, D
    AVRIEL, M
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1994, 80 (02) : 289 - 297
12345