An interactive algorithm to find the most preferred solution of multi-objective integer programs

Lokman B., Koksalan M., Korhonen P. J., Wallenius J.

ANNALS OF OPERATIONS RESEARCH, cilt.245, sa.1-2, ss.67-95, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 245 Sayı: 1-2
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1007/s10479-014-1545-2
  • Dergi Adı: ANNALS OF OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.67-95
  • Anahtar Kelimeler: Multi-objective optimization, Integer programming, Linear programming, Convex cones, MULTIPLE-CRITERIA PROBLEM, REFERENCE POINT APPROACH, CONVEX CONES, COMBINATORIAL OPTIMIZATION, DECISION-MAKING
  • TED Üniversitesi Adresli: Evet

Özet

In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM's preferences are consistent with a quasiconcave value function unknown to us. Based on the properties of quasiconcave value functions and pairwise preference information obtained from the DM, we generate constraints to restrict the implied inferior regions. The algorithm continues iteratively and guarantees to find the most preferred solution for integer programs. We test the performance of the algorithm on multi-objective assignment, knapsack, and shortest path problems and show that it works well.