Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs

KARAKAYA G., Köksalan M.

European Journal of Operational Research, cilt.308, sa.1, ss.215-228, 2023 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 308 Sayı: 1
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1016/j.ejor.2022.11.043
  • Dergi Adı: European Journal of Operational Research
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, International Bibliography of Social Sciences, ABI/INFORM, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Computer & Applied Sciences, EconLit, INSPEC, Public Affairs Index, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.215-228
  • Anahtar Kelimeler: Multiple objective programming, Tchebycheff function, Interactive approach, Preferred solution, INTERACTIVE APPROACH, CONE CONTRACTION, DECISION-MAKING
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

© 2022 Elsevier B.V.Many interactive approaches in multi-objective optimization assume the existence of an underlying preference function that represents the preferences of a decision maker (DM). In this paper, we develop the theory and an exact algorithm that guarantees finding the most preferred solution of a DM whose preferences are consistent with a Tchebycheff function for multi-objective integer programs. The algorithm occasionally presents pairs of solutions to the DM and asks which one is preferred. It utilizes the preference information together with the properties of the Tchebycheff function to generate solutions that are candidates to be the most preferred solution. We test the performance of the algorithm on a set of three and four-objective combinatorial optimization problems.