Solving the large airline disruption problems using a distributed computation approach to integer programming

Benchi Li, Chuangyin Dang, Jinjin Zheng

    Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

    6 Citations (Scopus)

    Abstract

    In this paper, a distributed implementation of Dang's iterative method [1] is proposed to solve the airline disruption problems caused by the airport closures. The problem consists of two subproblems, and the solution domain of the first subproblem is divided into several segments by the initial seeds cluster division method. Dang's method [1] is applied to solve the first subproblem in each segment simultaneously in a distributed computation network, and the obtained feasible flight routes are used to solve the second subproblem. Numerical results show that the proposed method is better than CPLEX and Liu et al. [2]. © 2013 IEEE.
    Original languageEnglish
    Title of host publication2013 IEEE 3rd International Conference on Information Science and Technology, ICIST 2013
    PublisherIEEE Computer Society
    Pages444-450
    DOIs
    Publication statusPublished - 2013
    Event2013 IEEE 3rd International Conference on Information Science and Technology, ICIST 2013 - Yangzhou, Jiangsu, China
    Duration: 23 Mar 201325 Mar 2013

    Conference

    Conference2013 IEEE 3rd International Conference on Information Science and Technology, ICIST 2013
    PlaceChina
    CityYangzhou, Jiangsu
    Period23/03/1325/03/13

    Fingerprint

    Dive into the research topics of 'Solving the large airline disruption problems using a distributed computation approach to integer programming'. Together they form a unique fingerprint.

    Cite this