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

Karsu, Ozlem; Ulus, Firdevs

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/258991</identifier>
  <creators>
    <creator>
      <creatorName>Karsu, Ozlem</creatorName>
      <givenName>Ozlem</givenName>
      <familyName>Karsu</familyName>
      <affiliation>Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Ulus, Firdevs</creatorName>
      <givenName>Firdevs</givenName>
      <familyName>Ulus</familyName>
      <affiliation>Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Split Algorithms For Multiobjective Integer Programming Problems</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2022</publicationYear>
  <dates>
    <date dateType="Issued">2022-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/258991</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1016/j.cor.2021.105673</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">We consider split algorithms that partition the objective function space into - 1 dimensional regions so as to search for nondominated points of multiobjective integer programming problems, where is the number of objectives. We provide a unified approach that allows different split strategies to be used within the same algorithmic framework with minimum change. We also suggest an effective way of making use of the information on subregions when setting the parameters of the scalarization problems used in the -split structure. We compare the performances of variants of these algorithms both as exact algorithms and as solution approaches under time restriction, considering the fact that finding the whole set may be computationally infeasible or undesirable in practice. We demonstrate through computational experiments that while the (-1)-split structure is superior in terms of overall computational time, the-split structure provides significant advantage under time/cardinality limited settings in terms of representativeness, especially with adaptive parameter setting and/or a suitably chosen order for regions to be explored.</description>
  </descriptions>
</resource>