Scholars@Duke publication: Greedy based pareto local search for bi-objective robust airport gate assignment problem

Greedy based pareto local search for bi-objective robust airport gate assignment problem

Publication , Conference

Sun, W; Cai, X; Xia, C; Sulaman, M; Mısır, M; Fan, Z

Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

January 1, 2017

Published version (DOI)

The present paper proposes a Greedy based Pareto Local Search (GB-PLS) algorithm for the bi-objective robust airport gate assignment problem (bRAGAP). The bRAGAP requires to minimize the total passenger walking distance and the total robust cost of gate assignment. The robust cost is measured through our proposed evaluation function considering the impact of delay cost on the allocation of idle time. GB-PLS uses the Random and Greedy Move (RGM) as a neighborhood search operator to improve the convergence and diversity of the solutions. Two populations are maintained in GB-PLS: the external population (EP) stores the nondominated solutions and the starting population (SP) maintains all the starting solutions for Pareto local search (PLS). The PLS is applied to search the neighborhood of each solution in the SP and the generated solutions are used to update the EP. A number of extensive experiments has been conducted to validate the performance of GB-PLS over Pareto Simulated Annealing (PSA).

Duke Scholars

Author Mustafa Misir DKU Faculty

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

10.1007/978-3-319-68759-9_56

EISSN

1611-3349

ISSN

0302-9743

ISBN

9783319687582

Publication Date

January 1, 2017

Volume

10593 LNCS

Start / End Page

694 / 705

Related Subject Headings

Artificial Intelligence & Image Processing

Citation

APA

Chicago

ICMJE

MLA

NLM

Sun, W., Cai, X., Xia, C., Sulaman, M., Mısır, M., & Fan, Z. (2017). Greedy based pareto local search for bi-objective robust airport gate assignment problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10593 LNCS, pp. 694–705). https://doi.org/10.1007/978-3-319-68759-9_56

Sun, W., X. Cai, C. Xia, M. Sulaman, M. Mısır, and Z. Fan. “Greedy based pareto local search for bi-objective robust airport gate assignment problem.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10593 LNCS:694–705, 2017. https://doi.org/10.1007/978-3-319-68759-9_56.

Sun W, Cai X, Xia C, Sulaman M, Mısır M, Fan Z. Greedy based pareto local search for bi-objective robust airport gate assignment problem. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. p. 694–705.

Sun, W., et al. “Greedy based pareto local search for bi-objective robust airport gate assignment problem.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10593 LNCS, 2017, pp. 694–705. Scopus, doi:10.1007/978-3-319-68759-9_56.

Sun W, Cai X, Xia C, Sulaman M, Mısır M, Fan Z. Greedy based pareto local search for bi-objective robust airport gate assignment problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2017. p. 694–705.

Published In

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DOI

10.1007/978-3-319-68759-9_56

EISSN

1611-3349

ISSN

0302-9743

ISBN

9783319687582

Publication Date

January 1, 2017

Volume

10593 LNCS

Start / End Page

694 / 705

Related Subject Headings

Artificial Intelligence & Image Processing