MCS -: A new algorithm for multicriteria optimisation in constraint programming

被引:9
|
作者
Le Huede, F.
Grabisch, M.
Labreuche, C.
Saveant, P.
机构
[1] THALES Res & Technol France, F-91401 Orsay, France
[2] Univ Paris 06, LIP 6, F-75015 Paris, France
[3] Univ Paris 01, F-75231 Paris 05, France
关键词
multicriteria optimization; multicriteria decision making; constraint programming;
D O I
10.1007/s10479-006-0064-1
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we propose a new algorithm called MCS for the search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers a good trade-off between criteria, the MCS algorithm alternates several Branch & Bound searches following diversified search strategies. It is implemented in CP in a dedicated framework and can be specialised for either complete or partial search.
引用
收藏
页码:143 / 174
页数:32
相关论文
共 50 条
  • [1] MCS—A new algorithm for multicriteria optimisation in constraint programming
    F. Le Huédé
    M. Grabisch
    C. Labreuche
    P. Savéant
    [J]. Annals of Operations Research, 2006, 147 : 143 - 174
  • [2] AN INTERACTIVE ALGORITHM FOR MULTICRITERIA PROGRAMMING
    CHOO, EU
    ATKINS, DR
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1980, 7 (1-2) : 81 - 87
  • [3] Constraint Programming and Combinatorial Optimisation in Numberjack
    Hebrard, Emmanuel
    O'Mahony, Eoin
    O'Sullivan, Barry
    [J]. INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, 2010, 6140 : 181 - 185
  • [4] Application of Constraint Programming in Business Process Optimisation
    Dincbas, M
    [J]. 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL X, PROCEEDINGS: MOBILE/WIRELESS COMPUTING AND COMMUNICATION SYSTEMS II, 2002, : 272 - 273
  • [5] A new constraint tournament selection method for multicriteria optimization using genetic algorithm
    Andrzej, O
    Stanislaw, K
    [J]. PROCEEDINGS OF THE 2000 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2000, : 501 - 508
  • [6] A new algorithm for quadratic integer programming problems with cardinality constraint
    Fenlan Wang
    Liyuan Cao
    [J]. Japan Journal of Industrial and Applied Mathematics, 2020, 37 : 449 - 460
  • [7] A new algorithm for quadratic integer programming problems with cardinality constraint
    Wang, Fenlan
    Cao, Liyuan
    [J]. JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2020, 37 (02) : 449 - 460
  • [8] Modelling discrete optimisation problems in constraint logic programming
    Barth, P
    Bockmayr, A
    [J]. ANNALS OF OPERATIONS RESEARCH, 1998, 81 (0) : 467 - 495
  • [9] Probabilistic Constraint Programming for Parameters Optimisation of Generative Models
    Zanin, Massimiliano
    Correia, Marco
    Sousa, Pedro A. C.
    Cruz, Jorge
    [J]. PROGRESS IN ARTIFICIAL INTELLIGENCE-BK, 2015, 9273 : 376 - 387
  • [10] Comparing constraint programming and mathematical programming approaches to discrete optimisation - the change problem
    Heipcke, S
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1999, 50 (06) : 581 - 595