Fitxa persona

ISAAC PLANA ANDANI
PDI-Catedratic/a d'Universitat
Director/a Titulacio Master Oficial

isaac.plana@uv.es
http://www.uv.es/plani

Área de conocimiento: MATEMÀTICA ECONOMICO-EMPRESARIAL
Departamento: Matemáticas para la Economía y la Empresa

(9616) 25090

Biografía

Doctor en Matemáticas, catedrático del Departamento de Matemáticas para la Economía y la Empresa y co-director del Máster en Planificación y Gestión de Procesos Empresariales.

Su area de investigación es la Investigación Operativa. Trabaja en la resolución de problemas de diseño de rutas de vehículos, especialmente en el campo de los problemas de rutas por arcos, mediante el diseño e implementación de algoritmos exactos y metaheurísticos. Forma parte del Grupo de Investigación en Optimización Combinatoria (GROC) y ha participado de forma continuada desde 2001 en proyectos de investigación competitivos.

Publicaciones en revistas

Claudia Archetti, Ángel Corberán, Isaac Plana, José M. Sanchis, M. Grazia Speranza (2016) A Branch-and-cut algorithm for the orienteering arc routing problem. Computers & Operations Research, 66, pp. 95 - 104 . ISSN: 0305-0548
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis (2017) The Hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm. European Journal of Operational Research, 257(1), pp. 1 - 12 . ISSN: 0377-2217
Thais Ávila, Ángel Corberán, Isaac Plana, José M. Sanchis (2016) A Branch-and-cut algorithm for the profitable windy rural postman problem. European Journal of Operational Research, 249(3), pp. 1092 - 1101 . ISSN: 0377-2217
Ávila, T.; Corberán, Á.; Plana, I.; Sanchis, J.M. (2016) A new branch-and-cut algorithm for the Generalized Directed Rural Postman Problem. Transportation Science, 50, pp. 750 - 761 . ISSN: 0041-1655
Thais Ávila; Ángel Corberán; Isaac Plana; José M. Sanchis (2017) Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. EURO Journal on Computational Optimization, 5(3), pp. 339 - 365 . ISSN: 2192-4406
Marco Colombi; Ángel Corberán; Renata Mansini; Isaac Plana; José M.Sanchis (2017) The Directed profitable rural postman problem with incompatibility constraints. European Journal of Operational Research, 261(2), pp. 549 - 562 . ISSN: 0377-2217
Ángel Corberán; Bruce Golden; Oliver Lum; Isaac Plana; José M. Sanchis (2017) Aesthetic considerations for the min-max K-Windy Rural Postman Problem. Networks, 70(3), pp. 216 - 232 . ISSN: 0028-3045
Marco Colombi; Ángel Corberán; Renata Mansini; Isaac Plana; José M. Sanchis (2017) The Hierarchical mixed rural postman problem. Transportation Science, 51(2), pp. 755 - 770 . ISSN: 0041-1655
J.F. Campbell; Á. Corberán; I. Plana; J.M. Sanchis (2018) Drone arc routing problems. Networks, 72(4), pp. 543 - 559 . ISSN: 0028-3045
A. Arigliano; G. Ghiani; A. Grieco; E. Guerriero; I. Plana (2019) Time dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm. Discrete Applied Mathematics, 261, pp. 28 - 39 . ISSN: 0166-218X
Corberán, Á, Erdogan, G., Laporte, G., Plana, I., Sanchis, J.M. (2018) The Chinese Postman Problem with Load-Dependent Costs. Transportation Science, 52, pp. 370 - 385 . ISSN: 0041-1655
Á. Corberán;I. Plana;M. Reula;J.M. Sanchis (2019) A Matheuristic for the distance-constrained close-enough arc routing problem. Top, 27(2), pp. 312 - 326 . ISSN: 1134-5764
J.F. Campbell; A. Coberán; I. Plana; J.M. Sanchis; P. Segura (2021) Solving the length constrained K-drones rural postman problem. European Journal of Operational Research, 292(1), pp. 60 - 72 . ISSN: 0377-2217
A. Corberán; R. Eglese; G. Hasle; I. Plana; J.M. Sanchis (2021) Arc routing problems: a review of the past, present, and future. Networks, 77(1), pp. 88 - 115 . ISSN: 0028-3045
A. Coberán; I. Plana; M. Reula; J.M. Sanchis (2021) On the Distance-constrained close enough arc routing problem. European Journal of Operational Research, 291(1), pp. 32 - 51 . ISSN: 0377-2217
N. Bianchessi; A. Coberán; I. Plana; M. Reula; J.M. Sanchis (2022) The Profitable close-enough arc routing problem. Computers & Operations Research, 140 . ISSN: 0305-0548
N. Bianchessi; A. Coberán; I. Plana; M. Reula; J.M. Sanchis (2022) The Min-max close-enough arc routing problem. European Journal of Operational Research, 300(3), pp. 837 - 851 . ISSN: 0377-2217
James Campbell; Ángel Corberán; Isaac Plana; José M. Sanchis; Paula Segura (2022) Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem. Computational Optimization and Applications, 83, pp. 67 - 109 . ISSN: 0926-6003
M. Landete; I. Plana; J.L. Sainz-Pardo; J.M. Sanchis (2023) Upgrading edges in the graphical TSP. Computers & Operations Research, 159 . ISSN: 0305-0548
J. Campbell; Á. Corberán; I. Plana; J.M. Sanchis; P. Segura (2023) The Multi-purpose K-drones general routing problem. Networks, 82, pp. 437 - 458 . ISSN: 0028-3045
Á. Corberán; I. Plana; J.M. Sanchis; P. Segura (2024) Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem. Computers & Operations Research, 162 . ISSN: 0305-0548
Teresa Corberán; Isaac Plana; José M. Sanchis; Paula Segura (2024) The Multidepot drone general routing problem with duration and capacity constraints. International Transactions In Operational Research. ISSN: 0969-6016
Teresa Corberán; Isaac Plana; José M. Sanchis (2025) The Min max multi-trip drone location arc routing problem. Computers & Operations Research, 174 . ISSN: 0305-0548

Proyectos

Tesis, tesinas y trabajos