This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them, thereby preventing them to make on-the-spot turns and restricting them to a minimum turn radius. This paper presents the implications of these constraints on the drone routing problem formulation and proposes a systematic technique to address them in the context of the team orienteering problem. Furthermore, a novel branch-and-price algorithm with branching techniques specific to the constraints imposed due to fixed-wing drones are proposed. Extensive computational experiments on benchmark instances corroborating the effectiveness of the algorithms are also presented.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    A branch-and-price algorithm for a team orienteering problem with fixed-wing drones


    Beteiligte:


    Erscheinungsdatum :

    2022




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    The Team Orienteering Arc Routing Problem

    Archetti, Claudia | Online Contents | 2014


    The Team Orienteering Arc Routing Problem

    Archetti, C. / Speranza, M.G. / Corberan, A. et al. | British Library Online Contents | 2014


    The Multiconstraint Team Orienteering Problem with Multiple Time Windows

    Souffriau, W. / Vansteenwegen, P. / Berghe, G.V. et al. | British Library Online Contents | 2013


    The Multiconstraint Team Orienteering Problem with Multiple Time Windows

    Souffriau, W. / Vansteenwegen, P. / Berghe, G.V. et al. | British Library Conference Proceedings | 2013