UMP Institutional Repository

Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO)

Azlan, Ahmad Tajuddin (2017) Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO). Faculty of Manufacturing Engineering, Universiti Malaysia Pahang.

[img]
Preview
PDF (Solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (DEPSO)-Table of contents)
Solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (DEPSO) - Table of contents.pdf - Accepted Version

Download (173kB) | Preview
[img]
Preview
PDF (Solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (DEPSO)-Abstract)
Solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (DEPSO) - Abstract.pdf - Accepted Version

Download (90kB) | Preview
[img]
Preview
PDF (Solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (DEPSO)-Chapter 1)
Solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (DEPSO) - Chapter 1.pdf - Accepted Version

Download (119kB) | Preview
[img]
Preview
PDF (Solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (DEPSO)-Rerefences)
Solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (DEPSO) - References.pdf - Accepted Version

Download (91kB) | Preview

Abstract

Assignment of flights to gates at an airport become very complex nowadays, especially for unprepared airport. In this investigation, the airport gate allocation problem is solved using a recently introduced Meta-heuristic and also one of the extensions from Particle Swarm Optimization (PSO) which is called Distance-Evaluated Particle Swarm Optimization (DEPSO). The first objective of this investigation is to minimize the passengers; total walking distance from gate to exit/entrance and from gate to gate (transit). Since the airport gate allocation problem is a discrete combinatorial problem, the original continuous PSO is extended to DEPSO such that PSO can be used to solve these discrete combinatorial problem. After that, the second objectives is to evaluate the performance of the DEPSO manually using Excel. Last but not least, a small real life problem or an application for the case study, an airport with 40 flights, 14 numbers of plane and 16 gates has been successfully optimized using DEPSO algorithm.

Item Type: Undergraduates Project Papers
Additional Information: Project Paper (Bachelor of Mechatronics Engineering (Hons.)) -- Universiti Malaysia Pahang – 2017, SV: MR. ZULKIFLI BIN MD YUSOF, NO CD: 10800
Uncontrolled Keywords: Particle Swarm Optimization; airport gate; Distance-Evaluated Particle Swarm Optimization (DEPSO)
Subjects: T Technology > TS Manufactures
Faculty/Division: Faculty of Manufacturing Engineering
Depositing User: Ms. Nurezzatul Akmal Salleh
Date Deposited: 02 Oct 2017 03:16
Last Modified: 02 Oct 2017 03:16
URI: http://umpir.ump.edu.my/id/eprint/18697
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item