Rafael Martı́

10.2k total citations · 1 hit paper
155 papers, 5.7k citations indexed

About

Rafael Martı́ is a scholar working on Industrial and Manufacturing Engineering, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Rafael Martı́ has authored 155 papers receiving a total of 5.7k indexed citations (citations by other indexed papers that have themselves been cited), including 78 papers in Industrial and Manufacturing Engineering, 54 papers in Artificial Intelligence and 43 papers in Computational Theory and Mathematics. Recurrent topics in Rafael Martı́'s work include Vehicle Routing Optimization Methods (70 papers), Metaheuristic Optimization Algorithms Research (48 papers) and Advanced Multi-Objective Optimization Algorithms (28 papers). Rafael Martı́ is often cited by papers focused on Vehicle Routing Optimization Methods (70 papers), Metaheuristic Optimization Algorithms Research (48 papers) and Advanced Multi-Objective Optimization Algorithms (28 papers). Rafael Martı́ collaborates with scholars based in Spain, United States and France. Rafael Martı́'s co-authors include Manuel Laguna, Fred Glover, Abraham Duarte, Vicente Campos, Maurício G. C. Resende, Micael Gallego, Leon S. Lasdon, John Plummer, Zsolt Ugray and James P. Kelly and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and Information Sciences.

In The Last Decade

Rafael Martı́

150 papers receiving 5.3k citations

Hit Papers

Scatter Search and Local ... 2007 2026 2013 2019 2007 100 200 300 400 500

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Rafael Martı́ 2.6k 1.5k 1.1k 777 613 155 5.7k
Rainer E. Burkard 2.1k 0.8× 699 0.5× 1.1k 1.0× 995 1.3× 414 0.7× 131 4.8k
Colin R. Reeves 2.3k 0.9× 1.4k 0.9× 659 0.6× 795 1.0× 449 0.7× 46 5.0k
Runwei Cheng 2.7k 1.0× 1.2k 0.8× 703 0.6× 558 0.7× 657 1.1× 31 6.1k
Christian Blum 2.6k 1.0× 3.4k 2.2× 1.5k 1.4× 1.5k 1.9× 609 1.0× 194 8.2k
Gérard Cornuéjols 2.3k 0.9× 537 0.4× 2.6k 2.3× 1.2k 1.5× 586 1.0× 147 6.2k
Shih-Wei Lin 3.5k 1.3× 1.5k 1.0× 269 0.2× 831 1.1× 294 0.5× 227 7.1k
Brigitte Jaumard 695 0.3× 753 0.5× 1.0k 0.9× 1.2k 1.5× 520 0.8× 350 4.4k
Katta G. Murty 1.7k 0.7× 547 0.4× 1.1k 1.0× 534 0.7× 312 0.5× 78 4.3k
David W. Coit 1.2k 0.5× 966 0.6× 1.0k 0.9× 597 0.8× 655 1.1× 201 12.0k
Andrea Roli 975 0.4× 1.7k 1.1× 868 0.8× 1.3k 1.6× 485 0.8× 169 4.7k

Countries citing papers authored by Rafael Martı́

Since Specialization
Citations

This map shows the geographic impact of Rafael Martı́'s research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rafael Martı́ with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rafael Martı́ more than expected).

Fields of papers citing papers by Rafael Martı́

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rafael Martı́. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rafael Martı́. The network helps show where Rafael Martı́ may publish in the future.

Co-authorship network of co-authors of Rafael Martı́

This figure shows the co-authorship network connecting the top 25 collaborators of Rafael Martı́. A scholar is included among the top collaborators of Rafael Martı́ based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rafael Martı́. Rafael Martı́ is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Laguna, Manuel, et al.. (2025). Greedy Randomized Adaptive Search Procedures with Path Relinking. An analytical review of designs and implementations. European Journal of Operational Research. 327(3). 717–734.
2.
Martı́, Rafael, et al.. (2024). Mathematical models and solving methods for diversity and equity optimization. Journal of Heuristics. 30(5-6). 291–323.
3.
Martı́, Rafael, Marc Sevaux, & Kenneth Sörensen. (2024). Fifty years of metaheuristics. European Journal of Operational Research. 321(2). 345–362. 23 indexed citations
4.
Martı́nez-Gavara, Anna, et al.. (2024). A Forward–Backward Simheuristic for the Stochastic Capacitated Dispersion Problem. Mathematics. 12(6). 909–909. 2 indexed citations
5.
Martı́, Rafael, et al.. (2023). Heuristics for the Profitable Close-Enough Arc Routing Problem. Expert Systems with Applications. 230. 120513–120513. 3 indexed citations
6.
Pardo, Eduardo G., et al.. (2023). Strategic oscillation tabu search for improved hierarchical graph drawing. Expert Systems with Applications. 243. 122668–122668. 3 indexed citations
7.
Martı́nez-Gavara, Anna, et al.. (2022). Max–min dispersion with capacity and cost for a practical location problem. Expert Systems with Applications. 200. 116899–116899. 8 indexed citations
8.
Martı́, Rafael, et al.. (2022). Scatter search for the minimum leaf spanning tree problem. Computers & Operations Research. 145. 105858–105858.
9.
Martı́, Rafael, et al.. (2021). A review on discrete diversity and dispersion maximization from an OR perspective. European Journal of Operational Research. 299(3). 795–813. 18 indexed citations
10.
Parreño, F., Ramón Álvarez-Valdés, & Rafael Martı́. (2020). Measuring diversity. A review and an empirical analysis. European Journal of Operational Research. 289(2). 515–532. 27 indexed citations
11.
Corberán, Ángel, et al.. (2019). Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems. Transportation Science. 53(4). 1126–1149. 16 indexed citations
12.
Pastore, Tommaso, et al.. (2019). Tabu search for min-max edge crossing in graphs. Computers & Operations Research. 114. 104830–104830. 8 indexed citations
13.
Caballero, Rafael, et al.. (2019). Iterated greedy with variable neighborhood search for a multiobjective waste collection problem. Expert Systems with Applications. 145. 113101–113101. 34 indexed citations
14.
Martı́, Rafael, et al.. (2018). Heuristics for the min–max arc crossing problem in graphs. Expert Systems with Applications. 109. 100–113. 9 indexed citations
15.
Colmenar, J. Manuel, Rafael Martı́, & Abraham Duarte. (2018). Heuristics for the Bi-Objective Diversity Problem. Expert Systems with Applications. 108. 193–205. 5 indexed citations
16.
Martı́nez-Gavara, Anna, et al.. (2018). Heuristics for the Constrained Incremental Graph Drawing Problem. European Journal of Operational Research. 274(2). 710–729. 9 indexed citations
17.
Corberán, Ángel, et al.. (2017). Models and solution methods for the uncapacitated r‐allocation p‐hub equitable center problem. International Transactions in Operational Research. 25(4). 1241–1267. 11 indexed citations
18.
Sánchez‐Oro, Jesús, Anna Martı́nez-Gavara, Manuel Laguna, Rafael Martı́, & Abraham Duarte. (2017). Variable neighborhood scatter search for the incremental graph drawing problem. Computational Optimization and Applications. 68(3). 775–797. 11 indexed citations
19.
Martı́, Rafael, et al.. (2015). Scatter search for an uncapacitated p-hub median problem. Computers & Operations Research. 58. 53–66. 30 indexed citations
20.
Egea, José A., Emmanuel Vázquez, Julio R. Banga, & Rafael Martı́. (2012). Improved scatter search for the global optimzation of computationally expensive dynamic models. DIGITAL.CSIC (Spanish National Research Council (CSIC)). 48 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026