Zobrazeno 1 - 10
of 54
pro vyhledávání: '"José M. Sanchis"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 5, Iss 3, Pp 339-365 (2017)
The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the
Externí odkaz:
https://doaj.org/article/93c8b2370ace48008f469dc1890230c0
Publikováno v:
European Journal of Operational Research. 300:837-851
Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, since they can serve them from
Publikováno v:
Computational Optimization and Applications. 83:67-109
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[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 (curved or straight) lines of a
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[EN] Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs tha
Autor:
Jose V. Bagan, José M. Sanchis-Bielsa, Manuel Leopoldo-Rodado, Leticia Bagan, Judith Murillo-Cortes
Publikováno v:
Journal of Periodontology. 90:1142-1148
Background Proliferative verrucous leukoplakia, recently coined as proliferative leukoplakia (PL), is associated with a strong tendency to recur after treatment and an elevated rate of malignant transformation. We compared the clinical characteristic
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[EN] Arc routing problems consist basically of finding one or several routes traversing a given set of arcs and/or edges that must be serviced. The Close-Enough Arc Routing Problem, or Generalized Directed Rural Postman Problem, does not assume that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a27d3c267336cd99432d900762066283
https://doi.org/10.1016/j.ejor.2020.09.012
https://doi.org/10.1016/j.ejor.2020.09.012
Publikováno v:
Computers & Operations Research. 140:105653
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[EN] In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains several important Arc Routing Problems as special cases and has very interesting real-life application
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8efe6fa4929fec5a49d3d00741655b8
https://doi.org/10.1016/j.ejor.2005.09.021
https://doi.org/10.1016/j.ejor.2005.09.021
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes