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

Genc, Hakki Murat; Erol, Osman Kaan; Eksin, Ibrahim; Okutan, Cesur Cevdet

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/99011</identifier>
  <creators>
    <creator>
      <creatorName>Genc, Hakki Murat</creatorName>
      <givenName>Hakki Murat</givenName>
      <familyName>Genc</familyName>
      <affiliation>TUBITAK BILGEM, Gebze, Kocaeli, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Erol, Osman Kaan</creatorName>
      <givenName>Osman Kaan</givenName>
      <familyName>Erol</familyName>
      <affiliation>Istanbul Tech Univ, TR-80626 Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Eksin, Ibrahim</creatorName>
      <givenName>Ibrahim</givenName>
      <familyName>Eksin</familyName>
      <affiliation>Istanbul Tech Univ, TR-80626 Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Okutan, Cesur Cevdet</creatorName>
      <givenName>Cesur Cevdet</givenName>
      <familyName>Okutan</familyName>
      <affiliation>TUBITAK BILGEM, Gebze, Kocaeli, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Enhanced Order Based Single Leap Big Bang - Big Crunch Optimization Approach To Multi-Objective Gate Assignment Problem</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2016</publicationYear>
  <dates>
    <date dateType="Issued">2016-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/99011</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.81043/aperta.99010</relatedIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.81043/aperta.99011</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">In the last few decades, rapid growth in demand for air transportation led to the development of numerous operation research practices in the airline / airport industry. The most widespread practice is the ground scheduling applications, and specifically, gate assignment optimization. An appropriate and efficient gate assignment is of great importance in airport ground operations since it plays a major role in increasing revenues. In this paper, a multi-objective gate assignment problem (MOGAP) is formulated with the objectives of maximizing gate allocation, minimizing passenger walking distance and maximizing flight to gate preference and a solution strategy based on the evolutionary Single Leap Big Bang - Big Crunch optimization method is developed. The MOGAP is a non-deterministic polynomial-time hard (NP-hard) quadratic assignment problem. In the literature, to the best of our knowledge, there is only a single effort to solve the MOGAP for obtaining a pareto front representation of solutions by utilizing nature inspired computation methods. As the major contributions of this paper, a novel multi-objective nature inspired solution technique is proposed and high fidelity problem instance generation is discussed. The effectiveness of the proposed methodology has been illustrated by comparing the simulation results of the method with the previously reported algorithm both on artificially generated problem instances and real world data obtained from Turkey's biggest airport, Ataturk International in Istanbul.</description>
  </descriptions>
</resource>