Ant search algorithm for multi-objective 0-1 knapsack problem

被引：0
|
作者：
Ma, L [1 ]
Yao, J [1 ]
Cui, XL [1 ]
机构：
[1] Univ Shanghai Sci & Technol, Coll Management, Shanghai 200093, Peoples R China
来源：
PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II | 2002年
关键词：
multi-objective; knapsack problem; ant algorithm;
D O I：
暂无
中图分类号：
F8 [财政、金融];
学科分类号：
0202 ;
摘要：
In this paper, a new artificial ant search algorithm for multi-objective 0-1 knapsack problem is presented based on the recently developed ant colony optimization strategy. Numerical examples are tested that report to have effectiveness and robustness.
引用
收藏
页码：2598 / 2601
页数：4
相关论文
共 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] Solving efficiently the 0-1 multi-objective knapsack problem
    Bazgan, Cristina
    Hugot, Hadrien
    Vanderpooten, Daniel
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (01) : 260 - 279
  • [3] 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 - +
  • [4] 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
  • [5] 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 - +
  • [6] ALGORITHM FOR 0-1 KNAPSACK PROBLEM
    LAURIERE, M
    MATHEMATICAL PROGRAMMING, 1978, 14 (01) : 1 - 10
  • [7] A hybrid adaptive multi-objective memetic algorithm for 0/1 knapsack problem
    Guo, XP
    Wu, ZM
    Yang, GK
    AI 2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2005, 3809 : 176 - 185
  • [8] 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
  • [9] A parallel Tabu Search algorithm for the 0-1 Multidimensional Knapsack Problem
    Niar, S
    Freville, A
    11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 512 - 516
  • [10] Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
    Feng, Yan-Hong
    Wang, Gai-Ge
    IEEE ACCESS, 2018, 6 : 10708 - 10719
12345