Publication:
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems

Placeholder

School / College / Institute

Organizational Unit

Program

KU Authors

Co-Authors

Fattahi, Ali

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

Multi-objective optimization problems (MOOP) reflect the complexity of many real-world decision problems where objectives are conflicting. The presence of more than one criterion makes finding the non-dominated (ND) points a crucial issue in the decision making process. Tri-objective mixed-integer linear programs (TOMILP) are an important subclass of MOOPs that are applicable to many problems in economics, business, science, and engineering including sustainable systems that must consider economic, environmental, and social concerns simultaneously. The literature on finding the ND points of TOMILPs is limited; there are only a few algorithms published in the literature that do not guarantee generating the entire ND points of TOMILPs. We present a new method, the Slicing with Adaptive Steps Search (SASS), to generate the ND points of TOMILPs. The result of SASS is primarily a superset of the set of ND points in the form of (partially) ND faces. We then perform a post-processing to eliminate the dominated parts of the partially ND faces. We provide a theoretical analysis of SASS and illustrate its effectiveness on a large set of instances.

Source

Publisher

Springer

Subject

Operations research, Management science

Citation

Has Part

Source

Annals of Operations Research

Book Series Title

Edition

DOI

10.1007/s10479-019-03422-9

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details