THE NOISING METHOD - A NEW METHOD FOR COMBINATORIAL OPTIMIZATION

被引：84
|
作者：
CHARON, I
HUDRY, O
机构：
[1] Ecole Nationale Supérieure des Télécommunications, Paris
来源：
OPERATIONS RESEARCH LETTERS | 1993年 / 14卷 / 03期
关键词：
HEURISTICS; COMBINATORIAL OPTIMIZATION; CLIQUE PARTITIONING OF A GRAPH; NP-HARD PROBLEMS;
D O I：
10.1016/0167-6377(93)90023-A
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper presents the principles and the first results of a new combinatorial optimization method that we calf the noising method. It is applied to the NP-hard problem of the clique partitioning of a graph. The results obtained from this problem which are definitely better than those provided by standard iterative-improvement methods and compare favorably with those of simulated annealing, show the relevance of the noising method.
引用
收藏
页码：133 / 137
页数：5
相关论文
共 50 条
  • [41] Combinatorial　Method　of　Simulation　and　Optimization　and　Its　Application　on　Transportation　System
    SUN Zhanshan(Institute of Systems Engineerjng
    Journal of Systems Science and Systems Engineering, 1995, (03) : 204 - 210
  • [42] Combinatorial Optimization Method Based on Hierarchical Structure in Solution Space
    Ochiai, Hiroki
    Kanazawa, Takahiko
    Tamura, Kenichi
    Yasuda, Keiichiro
    ELECTRONICS AND COMMUNICATIONS IN JAPAN, 2016, 99 (08) : 25 - 37
  • [43] Combinatorial Optimization Method Based on Hierarchical Structure in Solution Space
    Ochiai, Hiroki
    Tamura, Kenichi
    Yasuda, Keiichiro
    2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, : 3543 - 3548
  • [44] Build Your Own Bundle - A Neural Combinatorial Optimization Method
    Deng, Qilin
    Wang, Kai
    Zhao, Minghao
    Wu, Runze
    Ding, Yu
    Zou, Zhene
    Shang, Yue
    Tao, Jianrong
    Fan, Changjie
    PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, MM 2021, 2021, : 2625 - 2633
  • [45] Method of solving problem of conditional optimization on combinatorial set of arrangements
    Kolechkina L.N.
    Nagornaya A.N.
    Semenov V.V.
    Journal of Automation and Information Sciences, 2019, 51 (08) : 31 - 42
  • [46] Convergence proof for a Monte Carlo method for combinatorial optimization problems
    Fidanova, S
    COMPUTATIONAL SCIENCE - ICCS 2004, PROCEEDINGS, 2004, 3039 : 523 - 530
  • [47] DECOMPOSITION METHOD OF SOLVING A CLASS OF COMBINATORIAL OPTIMIZATION PROBLEMS.
    Kravets, V.L.
    Sergienko, I.V.
    1600, (19):
  • [48] A learning method in Hopfield neural network for combinatorial optimization problem
    Rong, LW
    Zheng, T
    Qi, PC
    NEUROCOMPUTING, 2002, 48 : 1021 - 1024
  • [49] A MODIFICATION OF THE ANNEALING IMITATION METHOD FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS
    KISELEV, BS
    KULAKOV, NY
    MIKAELYAN, AL
    TELECOMMUNICATIONS AND RADIO ENGINEERING, 1993, 48 (05) : 123 - 125
  • [50] Niching method for combinatorial optimization problems and application to JS']JSP
    Nagata, Yuichi
    2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 2807 - 2814
12345