<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Evalution of binary simulated Kalman filter and its application on airport gate scheduling</title>
  </titleInfo>
  <name type="personal">
    <namePart>Zarifah Mohamad Nor</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>software, multimedia</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">my</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Kuantan, Pahang</placeTerm>
    </place>
    <publisher>UMP</publisher>
    <dateIssued>2016</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">electronic</form>
    <form authority="gmd">electronic resource</form>
    <extent>1 computer disc : digital data ; 12 cm.</extent>
  </physicalDescription>
  <abstract>Airport gate allocation problem referred to the search for optimal assignment of flights to gates at an airport. Assignment of flight to gates becomes very complex nowadays, especially for a big size airport. SKF is an optimization that has been introduced recently. This algorithm is based on mechanism of Kalman Filter where every agent estimates the global minimum/maximum. SKF can only solve continuous numerical optimization problem. From this algorithm, enhancement and modification of SKF is introduced. Exploitation of the distance between an agent and the best agent let the SKF operates in binary search space. In this study, the airport gate allocation problem is solved using extended version of Simulated Kalman Filter algorithm called Binary Simulated Kalman Filter (BSKF).The main objective of this study is to minimize the total walking distance of passengers either from a gate to entrance/exit or gate to a gate. So, a small case study in an airport with 40 flights, 14 numbers of planes and 16 gates has been chosen and for evaluate BSKF, fix parameter of run, iteration and number of agents was set up.</abstract>
  <targetAudience authority="marctarget">specialized</targetAudience>
  <note type="statement of responsibility">Zarifah Mohamad Nor</note>
  <note>Faculty of Electrical &amp; Electronics Engineering</note>
  <note>Project Paper (Bachelor of Electrical Engineering (Hons.) (Electronics)) -- Universiti Malaysia Pahang – 2016</note>
  <note>Item in pdf format</note>
  <subject authority="lcsh">
    <name type="corporate">
      <namePart>Faculty of Electrical &amp; Electronics Engineering</namePart>
    </name>
    <topic>Dissertations</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Universities and Colleges</topic>
    <topic>Dissertations</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Theses</topic>
  </subject>
  <identifier type="isbn">THE0005140(Local)</identifier>
  <identifier type="uri">http://ecollib.ump.edu.my/id/eprint/25768</identifier>
  <location>
    <url>http://ecollib.ump.edu.my/id/eprint/25768</url>
  </location>
  <recordInfo>
    <recordContentSource authority="marcorg">UMP</recordContentSource>
    <recordCreationDate encoding="marc">170504</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251117113340.0</recordChangeDate>
    <recordIdentifier source="KUKTEM">vtls000100021</recordIdentifier>
  </recordInfo>
</mods>
