Mercedes Pelegrín
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mercedes Pelegrín has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Martina Cerulli
Department of Computer Science University of Salerno Fisciano Italy
3 shared publications - Alfredo Marín
Dpt. Stats & OR Institute of Mathematics (IMUS) Universidad de Murcia Universidad de Sevilla
2 shared publications - Claudia D'Ambrosio
Institut Polytechnique de Paris
2 shared publications Claudia D'AMbrosio
LIX CNRS, Ecole Polytechnique, Institut Polytechnique de Paris, Palaiseau, France
1 shared publication- Emilio Carrizosa
Universidad de Sevilla
1 shared publication - Leo Liberti
LIX CNRS, Ecole Polytechnique, Institut Polytechnique de Paris, Palaiseau, France
1 shared publication
Latest Publications
- 8 August 2023
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 38 (6) , 1311-1343
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights
- 8 August 2023
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 38 (6) , 1311-1343
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights
- 1 March 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 35 (2) , 274-285
Aircraft Conflict Resolution: A Benchmark Generator
Aircraft conflict resolution is one of the major tasks of computer-aided air traffic management and represents a challenging optimization problem. Many models and methods have been proposed to assist trajectory regulation to avoid conflicts. However, the question of testing the different mathematical optimization approaches against each other is still open. Standard benchmarks include unrealistic scenarios in which all the flights move toward a common point or completely random generated instances. There is a lack of a common set of test instances that allows comparison of the available methods under a variety of heterogeneous and representative scenarios. We present a flight deconfliction benchmark generator that allows the user to choose between (i) different predefined scenario inspired by existing benchmarks in the literature; (ii) pseudo-random traffic meeting certain congestion measurements; (iii) and randomly generated traffic. The proposed setting can account for different levels of difficulty in the deconfliction of the aircraft and allows to explore and compare the real limitations of optimization approaches for aircraft conflict resolution. History: Accepted by Ted Ralphs, area editor for Software Tools. Funding: This work was supported by the H2020 Marie Skłodowska-Curie Actions [Grant 764759 ITN “MINOA”]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.1265 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2021.0283 ) at ( http://dx.doi.org/10.5281/zenodo.7377734 ).
- 1 March 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 35 (2) , 274-285
Aircraft Conflict Resolution: A Benchmark Generator
Aircraft conflict resolution is one of the major tasks of computer-aided air traffic management and represents a challenging optimization problem. Many models and methods have been proposed to assist trajectory regulation to avoid conflicts. However, the question of testing the different mathematical optimization approaches against each other is still open. Standard benchmarks include unrealistic scenarios in which all the flights move toward a common point or completely random generated instances. There is a lack of a common set of test instances that allows comparison of the available methods under a variety of heterogeneous and representative scenarios. We present a flight deconfliction benchmark generator that allows the user to choose between (i) different predefined scenario inspired by existing benchmarks in the literature; (ii) pseudo-random traffic meeting certain congestion measurements; (iii) and randomly generated traffic. The proposed setting can account for different levels of difficulty in the deconfliction of the aircraft and allows to explore and compare the real limitations of optimization approaches for aircraft conflict resolution. History: Accepted by Ted Ralphs, area editor for Software Tools. Funding: This work was supported by the H2020 Marie Skłodowska-Curie Actions [Grant 764759 ITN “MINOA”]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.1265 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2021.0283 ) at ( http://dx.doi.org/10.5281/zenodo.7377734 ).
- 6 January 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Aircraft Conflict Resolution: A Benchmark Generator
Aircraft Conflict Resolution is one of the major tasks of computer-aided Air Traffic Management and represents a challenging optimization problem. This code generates benchmarking instances, each of them consisting of a set of flights with initial positions and vectors of velocities.
- 6 January 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Aircraft Conflict Resolution: A Benchmark Generator
Aircraft Conflict Resolution is one of the major tasks of computer-aided Air Traffic Management and represents a challenging optimization problem. This code generates benchmarking instances, each of them consisting of a set of flights with initial positions and vectors of velocities.
- 1 January 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 56 (1) , 118-140
Aircraft Deconfliction via Mathematical Programming: Review and Insights
Computer-aided air traffic management has increasingly attracted the interest of the operations research community. This includes, among other tasks, the design of decision support tools for the detection and resolution of conflict situations during flight. Even if numerous optimization approaches have been proposed, there has been little debate toward homogenization. We synthesize the efforts made by the operations research community in the past few decades to provide mathematical models to aid conflict detection and resolution at a tactical level. Different mathematical representations of aircraft separation conditions are presented in a unifying analysis. The models, which hinge on these conditions, are then revisited, providing insight into their computational performance.
- 1 January 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 56 (1) , 118-140
Aircraft Deconfliction via Mathematical Programming: Review and Insights
Computer-aided air traffic management has increasingly attracted the interest of the operations research community. This includes, among other tasks, the design of decision support tools for the detection and resolution of conflict situations during flight. Even if numerous optimization approaches have been proposed, there has been little debate toward homogenization. We synthesize the efforts made by the operations research community in the past few decades to provide mathematical models to aid conflict detection and resolution at a tactical level. Different mathematical representations of aircraft separation conditions are presented in a unifying analysis. The models, which hinge on these conditions, are then revisited, providing insight into their computational performance.
- 18 February 2021
- Published by Springer Nature in Journal of Global Optimization
- Vol. 81 (2) , 529-557
Detecting and solving aircraft conflicts using bilevel programming
- 18 February 2021
- Published by Springer Nature in Journal of Global Optimization
- Vol. 81 (2) , 529-557
Detecting and solving aircraft conflicts using bilevel programming
- 16 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (3) , 3916-3925
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality
Identifying key members in a social network is critical to understand the underlying system behavior. Whereas there are several measures designed to discern the most central member, they fail to identify a central set of members and at the same time reveal the spheres of influence of the individuals in such central set. Here, we combine eigenvector centrality with clustering to design a mathematical programming formulation capable of detecting key members while preventing their spheres of influence from overlapping. Our computational experience reproduces these two features as different aspects of the same phenomenon. The optimal set of key members and their spheres of influence are identified in real-life networks and synthetic ones. For the former, community structures are consistent with existing knowledge about the instances. For the latter, network underlying organization is known a priori and it is perfectly uncovered. Experiments further reveal previously neglected nodes to be optimal key members. The size of the instances tested reach several hundreds of nodes and thousands of links.
- 16 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (3) , 3916-3925
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality
Identifying key members in a social network is critical to understand the underlying system behavior. Whereas there are several measures designed to discern the most central member, they fail to identify a central set of members and at the same time reveal the spheres of influence of the individuals in such central set. Here, we combine eigenvector centrality with clustering to design a mathematical programming formulation capable of detecting key members while preventing their spheres of influence from overlapping. Our computational experience reproduces these two features as different aspects of the same phenomenon. The optimal set of key members and their spheres of influence are identified in real-life networks and synthetic ones. For the former, community structures are consistent with existing knowledge about the instances. For the latter, network underlying organization is known a priori and it is perfectly uncovered. Experiments further reveal previously neglected nodes to be optimal key members. The size of the instances tested reach several hundreds of nodes and thousands of links.
- 1 May 2018
- Published by Elsevier in Expert Systems with Applications
- Vol. 98, 221-241
Towards unambiguous map labeling - Integer programming approach and heuristic algorithm
- 1 May 2018
- Published by Elsevier in Expert Systems with Applications
- Vol. 98, 221-241
Towards unambiguous map labeling - Integer programming approach and heuristic algorithm