1 Ocak 2018 Dergi makalesi Açık Erişim

Fattahi, Ali; Turkay, Metin

Citation Style Language JSON

{
  "DOI": "10.1016/j.ejor.2017.09.026", 
  "abstract": "The nondominated frontier (NDF) of a biobjective optimization problem is defined as the set of feasible points in the objective function space that cannot be improved in one objective function value without worsening the other. For a biobjective mixed-binary linear programming problem (BOMBLP), the NDF consists of some combination of isolated points and open, closed, or half-open/half-closed line segments. Some algorithms have been proposed in the literature to find an approximate or exact representation of the NDF. We present a one direction search (ODS) method to find the exact NDF of BOMBLPs. We provide a theoretical analysis of the ODS method and show that it generates the exact NDF. We also conduct a comprehensive experimental study on a set of benchmark problems and show the solution quality and computational efficacy of our algorithm. (C) 2017 Elsevier B.V. All rights reserved.", 
  "author": [
    {
      "family": "Fattahi", 
      "given": " Ali"
    }, 
    {
      "family": "Turkay", 
      "given": " Metin"
    }
  ], 
  "container_title": "EUROPEAN JOURNAL OF OPERATIONAL RESEARCH", 
  "id": "34165", 
  "issue": "2", 
  "issued": {
    "date-parts": [
      [
        2018, 
        1, 
        1
      ]
    ]
  }, 
  "page": "415-425", 
  "title": "A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems", 
  "type": "article-journal", 
  "volume": "266"
}