Heuristic approaches for biobjective mixed 0-1 integer linear programming problems

Soylu B.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.245, sa.3, ss.690-703, 2015 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 245 Sayı: 3
  • Basım Tarihi: 2015
  • Doi Numarası: 10.1016/j.ejor.2015.04.010
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.690-703
  • Anahtar Kelimeler: Multiobjective programming, Biobjective mixed 0-1 integer linear programming, Variable neighborhood search, Local branching, VARIABLE NEIGHBORHOOD SEARCH, VECTOR MAXIMIZATION, PROPER EFFICIENCY, KNAPSACK-PROBLEM, BOUND ALGORITHM, LOCATION
  • Erciyes Üniversitesi Adresli: Evet

Özet

In this study, biobjective mixed 0-1 integer linear programming problems are considered and two heuristic approaches are presented to find the Pareto frontier of these problems. The first heuristic is a variant of the variable neighborhood search and explores the k-neighbors of a feasible solution (in terms of binary variables) to find the extreme supported Pareto points. The second heuristic is adapted from the local branching method, which is well-known in single objective mixed 0-1 integer linear programming. Finally, an algorithm is proposed to find Pareto segments of outcome line segments of these heuristics. A computational analysis is performed by using some test problems from the literature and the results are presented. (C) 2015 Elsevier B.V. All rights reserved.