Multi-objective integer programming: A general approach for generating all non-dominated solutions

Oezlen M., AZİZOĞLU M.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.199, sa.1, ss.25-35, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 199 Sayı: 1
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1016/j.ejor.2008.10.023
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.25-35
  • Anahtar Kelimeler: Multiple objective programming, Integer programming, LINEAR-PROGRAMS, VECTORS
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of completeness and comment on its efficiency. Then present our method on tri-objective integer programming problem and then extend it to the general MOIP problem with k objectives. A numerical example considering tri-objective assignment problem is also provided. (C) 2008 Elsevier B.V. All rights reserved.