Una Benlic

1.2k total citations
32 papers, 772 citations indexed

About

Una Benlic is a scholar working on Industrial and Manufacturing Engineering, Artificial Intelligence and Management Science and Operations Research. According to data from OpenAlex, Una Benlic has authored 32 papers receiving a total of 772 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Industrial and Manufacturing Engineering, 8 papers in Artificial Intelligence and 8 papers in Management Science and Operations Research. Recurrent topics in Una Benlic's work include Vehicle Routing Optimization Methods (22 papers), Optimization and Packing Problems (8 papers) and Metaheuristic Optimization Algorithms Research (8 papers). Una Benlic is often cited by papers focused on Vehicle Routing Optimization Methods (22 papers), Optimization and Packing Problems (8 papers) and Metaheuristic Optimization Algorithms Research (8 papers). Una Benlic collaborates with scholars based in China, United Kingdom and France. Una Benlic's co-authors include Jin‐Kao Hao, Qinghua Wu, Yongliang Lu, Edmund Burke, John R. Woodward, Qing Zhou, Alexander E. I. Brownlee, Zhipeng Lü, Michael G. Epitropakis and Bo Peng and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and Information Sciences.

In The Last Decade

Una Benlic

31 papers receiving 752 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Una Benlic China 17 407 257 161 133 112 32 772
Jadranka Skorin‐Kapov United States 12 1.1k 2.7× 137 0.5× 229 1.4× 77 0.6× 23 0.2× 39 1.4k
Ulrich Dorndorf Germany 16 794 2.0× 121 0.5× 159 1.0× 36 0.3× 209 1.9× 17 1.0k
Marcus Poggi de Aragão Brazil 15 694 1.7× 276 1.1× 145 0.9× 85 0.6× 14 0.1× 19 1.1k
Yazid M. Sharaiha United Kingdom 10 235 0.6× 160 0.6× 73 0.5× 181 1.4× 364 3.3× 23 1.3k
Zong-Gan Chen China 13 133 0.3× 481 1.9× 291 1.8× 291 2.2× 34 0.3× 21 945
César Rego United States 20 834 2.0× 465 1.8× 207 1.3× 177 1.3× 29 0.3× 42 1.2k
Gary L. Hogg United States 21 1.5k 3.7× 105 0.4× 184 1.1× 111 0.8× 32 0.3× 53 1.8k
Stan P.M. van Hoesel Netherlands 9 332 0.8× 77 0.3× 182 1.1× 132 1.0× 17 0.2× 11 643
Ouajdi Korbaa Tunisia 15 263 0.6× 215 0.8× 187 1.2× 160 1.2× 17 0.2× 119 788
Chris Lokan Australia 22 33 0.1× 381 1.5× 148 0.9× 98 0.7× 157 1.4× 69 1.2k

Countries citing papers authored by Una Benlic

Since Specialization
Citations

This map shows the geographic impact of Una Benlic'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 Una Benlic with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Una Benlic more than expected).

Fields of papers citing papers by Una Benlic

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Una Benlic. 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 Una Benlic. The network helps show where Una Benlic may publish in the future.

Co-authorship network of co-authors of Una Benlic

This figure shows the co-authorship network connecting the top 25 collaborators of Una Benlic. A scholar is included among the top collaborators of Una Benlic 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 Una Benlic. Una Benlic 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.
Zhou, Yangming, et al.. (2025). Solving soft and hard-clustered vehicle routing problems: A bi-population collaborative memetic search approach. European Journal of Operational Research. 324(3). 825–838.
2.
Benlic, Una, et al.. (2023). An effective hybrid evolutionary algorithm for the set orienteering problem. Information Sciences. 654. 119813–119813. 1 indexed citations
3.
Wu, Qinghua, et al.. (2023). A parallel adaptive memory algorithm for the capacitated modular hub location problem. Computers & Operations Research. 153. 106173–106173. 1 indexed citations
4.
Benlic, Una, et al.. (2022). A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. Computers & Operations Research. 144. 105799–105799. 6 indexed citations
5.
Sun, Zhe, Una Benlic, Mingjie Li, & Qinghua Wu. (2022). Reinforcement learning based tabu search for the minimum load coloring problem. Computers & Operations Research. 143. 105745–105745. 12 indexed citations
6.
Yan, Jin, et al.. (2022). Reinforcement learning based coarse-to-fine search for the maximum k -plex problem. Applied Soft Computing. 131. 109758–109758. 2 indexed citations
7.
Lü, Zhi, et al.. (2021). Iterated multilevel simulated annealing for large-scale graph conductance minimization. Information Sciences. 572. 182–199. 3 indexed citations
8.
Zhou, Qing, Una Benlic, & Qinghua Wu. (2020). An opposition-based memetic algorithm for the maximum quasi-clique problem. European Journal of Operational Research. 286(1). 63–83. 17 indexed citations
9.
Zhou, Qing, Una Benlic, & Qinghua Wu. (2020). A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks. Information Sciences. 541. 271–296. 4 indexed citations
10.
Lu, Yongliang, Una Benlic, & Qinghua Wu. (2020). An effective memetic algorithm for the generalized bike-sharing rebalancing problem. Engineering Applications of Artificial Intelligence. 95. 103890–103890. 29 indexed citations
11.
Lu, Yongliang, Una Benlic, & Qinghua Wu. (2018). Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. Computers & Operations Research. 97. 18–30. 5 indexed citations
12.
Lu, Yongliang, Una Benlic, & Qinghua Wu. (2018). A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. Computers & Operations Research. 101. 285–297. 15 indexed citations
13.
Benlic, Una, Michael G. Epitropakis, & Edmund Burke. (2017). A hybrid breakout local search and reinforcement learning approach to the vertex separator problem. European Journal of Operational Research. 261(3). 803–818. 16 indexed citations
14.
Benlic, Una. (2017). Heuristic search for allocation of slots at network level. Transportation Research Part C Emerging Technologies. 86. 488–509. 39 indexed citations
15.
Lu, Yongliang, Una Benlic, & Qinghua Wu. (2017). A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection. Computers & Operations Research. 90. 193–207. 29 indexed citations
16.
Benlic, Una, Edmund Burke, & John R. Woodward. (2016). Breakout local search for the multi-objective gate allocation problem. Computers & Operations Research. 78. 80–93. 42 indexed citations
17.
Benlic, Una & Jin‐Kao Hao. (2012). Breakout Local Search for maximum clique problems. Computers & Operations Research. 40(1). 192–206. 68 indexed citations
18.
Benlic, Una & Jin‐Kao Hao. (2012). Breakout Local Search for the Max-Cutproblem. Engineering Applications of Artificial Intelligence. 26(3). 1162–1173. 69 indexed citations
19.
Benlic, Una & Jin‐Kao Hao. (2012). Breakout local search for the quadratic assignment problem. Applied Mathematics and Computation. 219(9). 4800–4815. 72 indexed citations
20.
Benlic, Una & Jin‐Kao Hao. (2011). A Multilevel Memetic Approach for Improving Graph k-Partitions. IEEE Transactions on Evolutionary Computation. 15(5). 624–642. 62 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

Breakdown of academic impact, for papers by Jadranka Skorin‐Kapov Breakdown of academic impact, for papers by Ulrich Dorndorf Breakdown of academic impact, for papers by Marcus Poggi de Aragão Breakdown of academic impact, for papers by Yazid M. Sharaiha Breakdown of academic impact, for papers by Zong-Gan Chen Breakdown of academic impact, for papers by César Rego Breakdown of academic impact, for papers by Gary L. Hogg Breakdown of academic impact, for papers by Stan P.M. van Hoesel Breakdown of academic impact, for papers by Ouajdi Korbaa Breakdown of academic impact, for papers by Chris Lokan
Rankless by CCL
2026