The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs

被引：43
|
作者：
Boland, Natashia [2 ]
Charkhgard, Hadi [1 ]
Savelsbergh, Martin [2 ]
机构：
[1] Univ Newcastle, Sch Math & Phys Sci, Callaghan, NSW, Australia
[2] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2017年 / 260卷 / 03期
关键词：
Tri-objective integer programs; Quadrant shrinking method; Criterion space search method; Nondominated frontier;
D O I：
10.1016/j.ejor.2016.03.035
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We present a new variant of the full 2-split algorithm, the Quadrant Shrinking Method (QSM), for finding all nondominated points of a tri-objective integer program. The algorithm is easy to implement and solves at most 3 vertical bar Y-N vertical bar +1 single-objective integer programs when computing the nondominated frontier, where Y-N is the set of all nondominated points. A computational study demonstrates the efficacy of QSM. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码：873 / 885
页数：13
相关论文
共 50 条
  • [21] SIMPLE ALGORITHM FOR INTEGER PROGRAMS USING GROUP CONSTRAINTS
    BELL, DE
    OPERATIONAL RESEARCH QUARTERLY, 1977, 28 (02) : 453 - 458
  • [22] A simple finite cutting plane algorithm for integer programs
    Neto, Jose
    OPERATIONS RESEARCH LETTERS, 2012, 40 (06) : 578 - 580
  • [23] An algorithm for solving multiple objective integer linear programming problem
    Abbas, M
    Chaabane, D
    RAIRO-OPERATIONS RESEARCH, 2002, 36 (04): : 351 - 364
  • [24] A fast and robust algorithm for solving biobjective mixed integer programs
    Pecin, Diego
    Herszterg, Ian
    Perini, Tyler
    Boland, Natashia
    Savelsbergh, Martin
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2024, 100 (01) : 221 - 262
  • [25] An interactive approximation algorithm for multi-objective integer programs
    Lokman, Banu
    Koksalan, Murat
    Korhonen, Pekka J.
    Wallenius, Jyrki
    COMPUTERS & OPERATIONS RESEARCH, 2018, 96 : 80 - 90
  • [26] SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
    Rasmi, Seyyed Amir Babak
    Fattahi, Ali
    Turkay, Metin
    ANNALS OF OPERATIONS RESEARCH, 2021, 296 (1-2) : 841 - 876
  • [27] A tri-objective preference-based uniform weight design method using Delaunay triangulation
    Dazhuang Liu
    Yutao Qi
    Rui Yang
    Yining Quan
    Xiaodong Li
    Qiguang Miao
    Soft Computing, 2021, 25 : 9703 - 9729
  • [28] SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
    Seyyed Amir Babak Rasmi
    Ali Fattahi
    Metin Türkay
    Annals of Operations Research, 2021, 296 : 841 - 876
  • [29] A queuing approach for a tri-objective manufacturing problem with defects: a tuned Pareto-based genetic algorithm
    Pasandideh, Seyed Hamid Reza
    Niaki, Seyed Taghi Akhavan
    Maleki, Leila
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 73 (9-12): : 1373 - 1385
  • [30] A queuing approach for a tri-objective manufacturing problem with defects: a tuned Pareto-based genetic algorithm
    Seyed Hamid Reza Pasandideh
    Seyed Taghi Akhavan Niaki
    Leila Maleki
    The International Journal of Advanced Manufacturing Technology, 2014, 73 : 1373 - 1385
12345