Home           Contact us           FAQs           
    
     Journal Home     |     Aim & Scope    |    Author(s) Information      |     Editorial Board     |     MSP Download Statistics
    Abstract
2013 (Vol. 5, Issue: 10)
Article Information:

A Discrete Particle Swarm Optimization Algorithm for Gate and Runway Combinatorial Optimization Problem

Jianli Ding and Yong Zhang
Corresponding Author:  Yong Zhang 

Key words:  Airport operation, combinatorial optimization model, discrete particle swarm optimization, gate assignment, runway assignment, ,
Vol. 5 , (10): 2997-2003
Submitted Accepted Published
September 16, 2012 November 01, 2012 March 25, 2013
Abstract:

In this study, we set the average taxi time of flight as the objective of the gate and runway assignment problem. We present a gate and runway combinatorial optimization model with several restrictions such as restrictions of gate and runway time, type of aircraft and service. We design a Discrete Particle Swarm Optimization (DPSO) algorithm to solve this problem. Inspired by the genetic algorithm and combined with the neighborhood search, we propose a new location update strategy. Finally, numerical experiments were carried out on two cases where gate supplication is adequate and itís not, experimental results show that the discrete particle swarm algorithm achieved very good results.
Abstract PDF HTML
  Cite this Reference:
Jianli Ding and Yong Zhang, 2013. A Discrete Particle Swarm Optimization Algorithm for Gate and Runway Combinatorial Optimization Problem.  Research Journal of Applied Sciences, Engineering and Technology, 5(10): 2997-2003.
    Advertise with us
 
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2015. MAXWELL Scientific Publication Corp., All rights reserved