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

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

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...

Full description

Bibliographic Details
Main Author: Azlan, Ahmad Tajuddin
Format: Undergraduates Project Papers
Language:English
English
English
English
Published: 2017
Subjects:
TS Manufactures
Online Access:http://umpir.ump.edu.my/id/eprint/18697/
http://umpir.ump.edu.my/id/eprint/18697/
http://umpir.ump.edu.my/id/eprint/18697/1/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Table%20of%20contents.pdf
http://umpir.ump.edu.my/id/eprint/18697/7/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Abstract.pdf
http://umpir.ump.edu.my/id/eprint/18697/13/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Chapter%201.pdf
http://umpir.ump.edu.my/id/eprint/18697/19/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20References.pdf
id ump-18697
recordtype eprints
spelling ump-186972017-10-02T03:16:48Z http://umpir.ump.edu.my/id/eprint/18697/ Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO) Azlan, Ahmad Tajuddin TS Manufactures 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. 2017-06 Undergraduates Project Papers NonPeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/18697/1/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Table%20of%20contents.pdf application/pdf en http://umpir.ump.edu.my/id/eprint/18697/7/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Abstract.pdf application/pdf en http://umpir.ump.edu.my/id/eprint/18697/13/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Chapter%201.pdf application/pdf en http://umpir.ump.edu.my/id/eprint/18697/19/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20References.pdf Azlan, Ahmad Tajuddin (2017) Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO). Faculty of Manufacturing Engineering, Universiti Malaysia Pahang. http://iportal.ump.edu.my/lib/item?id=chamo:101050&theme=UMP2
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
English
English
English
topic TS Manufactures
spellingShingle TS Manufactures
Azlan, Ahmad Tajuddin
Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO)
description 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.
format Undergraduates Project Papers
author Azlan, Ahmad Tajuddin
author_facet Azlan, Ahmad Tajuddin
author_sort Azlan, Ahmad Tajuddin
title Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO)
title_short Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO)
title_full Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO)
title_fullStr Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO)
title_full_unstemmed Solving gate allocation problem (AGAP) using distance-evaluated particle swarm optimization (DEPSO)
title_sort solving gate allocation problem (agap) using distance-evaluated particle swarm optimization (depso)
publishDate 2017
url http://umpir.ump.edu.my/id/eprint/18697/
http://umpir.ump.edu.my/id/eprint/18697/
http://umpir.ump.edu.my/id/eprint/18697/1/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Table%20of%20contents.pdf
http://umpir.ump.edu.my/id/eprint/18697/7/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Abstract.pdf
http://umpir.ump.edu.my/id/eprint/18697/13/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20Chapter%201.pdf
http://umpir.ump.edu.my/id/eprint/18697/19/Solving%20gate%20allocation%20problem%20%28agap%29%20using%20distance-evaluated%20particle%20swarm%20optimization%20%28DEPSO%29%20-%20References.pdf
first_indexed 2023-09-18T22:26:38Z
last_indexed 2023-09-18T22:26:38Z
_version_ 1777416010559651840

Similar Items