The Experts below are selected from a list of 168 Experts worldwide ranked by ideXlab platform

Christos G. Cassandras - One of the best experts on this subject based on the ideXlab platform.

  • A Hierarchical Heuristic Approach for Solving Air Traffic Scheduling and Routing Problem With a Novel Air Traffic Model
    IEEE Transactions on Intelligent Transportation Systems, 2019
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling play an important role in air traffic flow management, which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper, we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints, and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. On the resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircrafts. The effectiveness of the proposed hierarchical approach is illustrated by air traffic data in four flight information regions in the association of Southeast Asian nations.

  • CDC - A hierarchical approach for air traffic routing and scheduling
    2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling plays an important role in air traffic flow management (ATFM), which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. Upon resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircraft. The effectiveness of the proposed hierarchical approach is illustrated by realistic air traffic data in four ASEAN Flight Information Regions (FIRs).

  • A hierarchical approach for air traffic routing and scheduling
    2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling plays an important role in air traffic flow management (ATFM), which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. Upon resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircraft. The effectiveness of the proposed hierarchical approach is illustrated by realistic air traffic data in four ASEAN Flight Information Regions (FIRs).

Jeffrey Xu Yu - One of the best experts on this subject based on the ideXlab platform.

  • PBiTree coding and efficient processing of Containment joins
    Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405), 2003
    Co-Authors: Wei Wang, Haifeng Jiang, Hongjun Lu, Jeffrey Xu Yu
    Abstract:

    We address issue related to Containment join processing in tree-structured data such as XML documents. A Containment join takes two sets of XML node elements as input and returns pairs of elements such that the Containment Relationship holds between them. While there are previous algorithms for processing Containment joins, they require both element sets either sorted or indexed. We propose a novel and complete Containment query processing framework based on a new coding scheme, PBiTree code. The PBiTree code allows us to determine the ancestor-descendant Relationship between two elements from their PBiTree-based codes efficiently. We present algorithms in the framework that are optimized for various combinations of settings. In particular, the newly proposed partitioning based algorithms can process Containment joins efficiently without sorting or indexes. Experimental results indicate that the Containment join processing algorithms based on the proposed coding scheme outperform existing algorithms significantly.

  • ICDE - PBiTree coding and efficient processing of Containment joins
    Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405), 2003
    Co-Authors: Wei Wang, Haifeng Jiang, Hongjun Lu, Jeffrey Xu Yu
    Abstract:

    We address issue related to Containment join processing in tree-structured data such as XML documents. A Containment join takes two sets of XML node elements as input and returns pairs of elements such that the Containment Relationship holds between them. While there are previous algorithms for processing Containment joins, they require both element sets either sorted or indexed. We propose a novel and complete Containment query processing framework based on a new coding scheme, PBiTree code. The PBiTree code allows us to determine the ancestor-descendant Relationship between two elements from their PBiTree-based codes efficiently. We present algorithms in the framework that are optimized for various combinations of settings. In particular, the newly proposed partitioning based algorithms can process Containment joins efficiently without sorting or indexes. Experimental results indicate that the Containment join processing algorithms based on the proposed coding scheme outperform existing algorithms significantly.

Yicheng Zhang - One of the best experts on this subject based on the ideXlab platform.

  • A Hierarchical Heuristic Approach for Solving Air Traffic Scheduling and Routing Problem With a Novel Air Traffic Model
    IEEE Transactions on Intelligent Transportation Systems, 2019
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling play an important role in air traffic flow management, which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper, we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints, and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. On the resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircrafts. The effectiveness of the proposed hierarchical approach is illustrated by air traffic data in four flight information regions in the association of Southeast Asian nations.

  • CDC - A hierarchical approach for air traffic routing and scheduling
    2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling plays an important role in air traffic flow management (ATFM), which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. Upon resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircraft. The effectiveness of the proposed hierarchical approach is illustrated by realistic air traffic data in four ASEAN Flight Information Regions (FIRs).

  • A hierarchical approach for air traffic routing and scheduling
    2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling plays an important role in air traffic flow management (ATFM), which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. Upon resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircraft. The effectiveness of the proposed hierarchical approach is illustrated by realistic air traffic data in four ASEAN Flight Information Regions (FIRs).

Uwe Zdun - One of the best experts on this subject based on the ideXlab platform.

  • Towards a Framework for Detecting Containment Violations in Service Choreography
    2017 IEEE International Conference on Services Computing (SCC), 2017
    Co-Authors: Faiz Ul Muram, Muhammad Atif Javed, Huy Tran, Uwe Zdun
    Abstract:

    In the design and development of service oriented applications, service choreography models describe the interactions between services at different abstraction levels. These models are usually created and evolved independently by different stakeholders and consequently deviations occur among models such as message not received and incompatible behaviours. It is therefore crucial to detect and resolve the deviations before actual implementation and deployment is undertaken. This paper presents a Containment checking approach that verifies whether the behaviour (or interactions) described by the local choreography models collectively encompasses those specified in the global model. Previous studies have not considered the Containment Relationship between global and local choreography models. The proposed approach performs automated transformation of service choreography models into formal descriptions and consistency constraints for leveraging the analytical powers of model checking techniques for the Containment verification. The approach provides more informative and comprehensive feedbacks to the stakeholders for identification of Containment problems and their resolutions. The applicability of the approach is demonstrated through use case scenarios of ATM machine, travel booking and order processing systems.

  • SCC - Towards a Framework for Detecting Containment Violations in Service Choreography
    2017 IEEE International Conference on Services Computing (SCC), 2017
    Co-Authors: Faiz Ul Muram, Muhammad Atif Javed, Huy Tran, Uwe Zdun
    Abstract:

    In the design and development of service oriented applications, service choreography models describe the interactions between services at different abstraction levels. These models are usually created and evolved independently by different stakeholders and consequently deviations occur among models such as message not received and incompatible behaviours. It is therefore crucial to detect and resolve the deviations before actual implementation and deployment is undertaken. This paper presents a Containment checking approach that verifies whether the behaviour (or interactions) described by the local choreography models collectively encompasses those specified in the global model. Previous studies have not considered the Containment Relationship between global and local choreography models. The proposed approach performs automated transformation of service choreography models into formal descriptions and consistency constraints for leveraging the analytical powers of model checking techniques for the Containment verification. The approach provides more informative and comprehensive feedbacks to the stakeholders for identification of Containment problems and their resolutions. The applicability of the approach is demonstrated through use case scenarios of ATM machine, travel booking and order processing systems.

  • A Model Checking Based Approach for Containment Checking of UML Sequence Diagrams
    2016 23rd Asia-Pacific Software Engineering Conference (APSEC), 2016
    Co-Authors: Faiz Ul Muram, Huy Tran, Uwe Zdun
    Abstract:

    The main challenge in software development process is to detect and fix the deviations of system's behaviors at different abstraction levels in early phases. For this purpose, UML 2 sequence diagrams are widely used for describing and analyzing the communication behavior of software systems. This paper describes a Containment checking approach for UML 2 sequence diagrams to verify whether the behavior (or functions) described by a low-level model conforms those specified in the high-level counterpart based on model checking techniques, in order to improve the system's quality. However, creating consistency constraints and formal specifications for the sequence diagrams is a labor-intensive and error prone task. To alleviate this issue, we propose an automated transformation of sequence diagrams into formal specifications and consistency constraints that enable us to leverage the analytical powers of model checking to automatically verify the Containment Relationship. In addition, our approach provides the stakeholders more informative and comprehensive feedbacks regarding the inconsistency issues, and therefore helps them to efficiently identify and resolve the problems. The approach is implemented and validated using three realistic scenarios.

Rong Su - One of the best experts on this subject based on the ideXlab platform.

  • A Hierarchical Heuristic Approach for Solving Air Traffic Scheduling and Routing Problem With a Novel Air Traffic Model
    IEEE Transactions on Intelligent Transportation Systems, 2019
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling play an important role in air traffic flow management, which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper, we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints, and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. On the resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircrafts. The effectiveness of the proposed hierarchical approach is illustrated by air traffic data in four flight information regions in the association of Southeast Asian nations.

  • CDC - A hierarchical approach for air traffic routing and scheduling
    2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling plays an important role in air traffic flow management (ATFM), which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. Upon resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircraft. The effectiveness of the proposed hierarchical approach is illustrated by realistic air traffic data in four ASEAN Flight Information Regions (FIRs).

  • A hierarchical approach for air traffic routing and scheduling
    2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017
    Co-Authors: Yicheng Zhang, Rong Su, Gammana Guruge Nadeesha Sandamali, Yi Zhang, Christos G. Cassandras
    Abstract:

    Efficient flight routing and scheduling plays an important role in air traffic flow management (ATFM), which aims to maximize the utilization of airport and enroute capacities to ensure safety and efficiency of air transportation. In this paper we first propose a novel discrete-time flow dynamic model for an air traffic network, consisting of airports, waypoints and air links, upon which we formulate an air flow routing and scheduling problem as an integer linear programming problem. Considering the NP-hard nature of the problem, we present a novel hierarchical flow routing and scheduling approach, where the hierarchical architecture is derived naturally from the network Containment Relationship, and computation is carried out in a bottom-up manner, which relies on an incremental strategy. Upon resulting flow routes and schedules, a heuristic algorithm is carried out to determine flight plans for individual aircraft. The effectiveness of the proposed hierarchical approach is illustrated by realistic air traffic data in four ASEAN Flight Information Regions (FIRs).