Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por autor "Segura Martínez, Paula"

Mostrando ítems 1-5 de 5

Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem

Campbell, James; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula (Springer-Verlag, 2022-09)

[EN] The Length Constrained K¿Drones Rural Postman Problem (LC K¿DRPP) is a continuous optimization problem where a set of curved or straight lines of a network have to be traversed, in order to be serviced, by a fleet ...
Solving the length constrained K-drones rural postman problem

Campbell, James F.; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula (Elsevier, 2021-07-01)

[EN] In this paper we address the Length Constrained K-Drones Rural Postman Problem (LC K-DRPP). This is a continuous optimization problem where a fleet of homogeneous drones have to jointly service (traverse) a set of ...
The multi-purpose K-drones general routing problem

Campbell, James; Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula (John Wiley & Sons, 2023-12)

[EN] In this article, we present and solve the multi-pur pose K-drones general routing problem (MP K-DGRP). In this optimization problem, a fleet of multi-pur pose drones, aerial vehicles that can both make deliveries and ...
The multidepot drone general routing problem with duration and capacity constraints

Corberán, Teresa; Plana, Isaac; Sanchis, José M.; Segura-Martínez, Paula (Blackwell Publishing, 2024)

[EN] This paper studies the multidepot drone general routing problem with duration and capacity constraints (MDdGRP), an extension of the classical general routing problem with several depots. A fleet of drones with limited ...
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem

Corberán, Ángel; Plana, Isaac; Sanchís Llopis, José María; Segura-Martínez, Paula (Elsevier, 2024-02)

[EN] The Rural Postman Problem (RPP) is one of the most well-known problems in arc routing. Given an undirected graph, the RPP consists of finding a closed walk traversing and servicing a given subset of edges with minimum ...