Una Benlic

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 24

Top Topics

Reinforcement Learning

Parallel Machine Scheduling Problem

Traveling Salesman

Memetic Algorithm

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Eng. Appl. Artif. Intell.

Publications

Yongliang Lu, Una Benlic, Qinghua Wu
An effective hybrid evolutionary algorithm for the set orienteering problem. Inf. Sci. 654 (2024)
Mu He, Qinghua Wu, Una Benlic, Yongliang Lu, Yuning Chen
An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem. Eur. J. Oper. Res. 318 (3) (2024)
Qinghua Wu, Zhe Sun, Una Benlic, Yongliang Lu
A parallel adaptive memory algorithm for the capacitated modular hub location problem. Comput. Oper. Res. 153 (2023)
Zhe Sun, Una Benlic, Mingjie Li, Qinghua Wu
Reinforcement learning based tabu search for the minimum load coloring problem. Comput. Oper. Res. 143 (2022)
Yan Jin, John H. Drake, Kun He, Una Benlic
Reinforcement learning based coarse-to-fine search for the maximum k-plex problem. Appl. Soft Comput. 131 (2022)
Yongliang Lu, Una Benlic, Qinghua Wu
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 144 (2022)
Yongliang Lu, Una Benlic, Qinghua Wu
A highly effective hybrid evolutionary algorithm for the covering salesman problem. Inf. Sci. 564 (2021)
Zhi Lu, Jin-Kao Hao, Una Benlic, David Lesaint
Iterated multilevel simulated annealing for large-scale graph conductance minimization. Inf. Sci. 572 (2021)
Yongliang Lu, Una Benlic, Qinghua Wu
An effective memetic algorithm for the generalized bike-sharing rebalancing problem. Eng. Appl. Artif. Intell. 95 (2020)
Junwen Ding, Liji Shen, Zhipeng Lü, Liping Xu, Una Benlic
A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects. IEEE Trans. Emerg. Top. Comput. Intell. 4 (3) (2020)
Zhouxing Su, Zhipeng Lü, Zhuo Wang, Yanmin Qi, Una Benlic
A Matheuristic Algorithm for the Inventory Routing Problem. Transp. Sci. 54 (2) (2020)
Qing Zhou, Una Benlic, Qinghua Wu
An opposition-based memetic algorithm for the maximum quasi-clique problem. Eur. J. Oper. Res. 286 (1) (2020)
Qing Zhou, Una Benlic, Qinghua Wu
A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks. Inf. Sci. 541 (2020)
Katerina Klimova, Una Benlic
Heuristic Search for a Real-World 3D Stock Cutting Problem. OR (2019)
Yan Jin, John H. Drake, Una Benlic, Kun He
Effective reinforcement learning based local search for the maximum k-plex problem. CoRR (2019)
Yongliang Lu, Una Benlic, Qinghua Wu
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 101 (2019)
Yongliang Lu, Una Benlic, Qinghua Wu, Bo Peng
Memetic algorithm for the multiple traveling repairman problem with profits. Eng. Appl. Artif. Intell. 80 (2019)
Qing Zhou, Una Benlic, Qinghua Wu, Jin-Kao Hao
Heuristic search to the capacitated clustering problem. Eur. J. Oper. Res. 273 (2) (2019)
Yongliang Lu, Una Benlic, Qinghua Wu
Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 97 (2018)
Yongliang Lu, Una Benlic, Qinghua Wu
A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection. Comput. Oper. Res. 90 (2018)
Yongliang Lu, Una Benlic, Qinghua Wu
A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints. Eur. J. Oper. Res. 268 (1) (2018)
Una Benlic, Michael G. Epitropakis, Edmund K. Burke
A hybrid breakout local search and reinforcement learning approach to the vertex separator problem. Eur. J. Oper. Res. 261 (3) (2017)
Una Benlic, Edmund K. Burke, John R. Woodward
Breakout local search for the multi-objective gate allocation problem. Comput. Oper. Res. 78 (2017)
Shahrzad M. Pour, Una Benlic
Clustering of Maintenance Tasks for the Danish Railway System. ISDA (2016)
Una Benlic, Jin-Kao Hao
Memetic search for the quadratic assignment problem. Expert Syst. Appl. 42 (1) (2015)
Tao Qin, Bo Peng, Una Benlic, T. C. E. Cheng, Yang Wang, Zhipeng Lü
Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling. Comput. Oper. Res. 61 (2015)
Una Benlic, Jin-Kao Hao
Breakout Local Search for maximum clique problems. Comput. Oper. Res. 40 (1) (2013)
Una Benlic, Jin-Kao Hao
Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219 (9) (2013)
Una Benlic, Jin-Kao Hao
Breakout Local Search for the Max-Cutproblem. Eng. Appl. Artif. Intell. 26 (3) (2013)
Una Benlic, Jin-Kao Hao
A Study of Adaptive Perturbation Strategy for Iterated Local Search. EvoCOP (2013)
Una Benlic, Jin-Kao Hao
Breakout Local Search for the Vertex Separator Problem. IJCAI (2013)
Una Benlic, Jin-Kao Hao
A Study of Breakout Local Search for the Minimum Sum Coloring Problem. SEAL (2012)
Una Benlic, Jin-Kao Hao
A Multilevel Memetic Approach for Improving Graph k-Partitions. IEEE Trans. Evol. Comput. 15 (5) (2011)
Una Benlic, Jin-Kao Hao
An effective multilevel tabu search approach for balanced graph partitioning. Comput. Oper. Res. 38 (7) (2011)
Jin-Kao Hao, Una Benlic
Lower bounds for the ITC-2007 curriculum-based course timetabling problem. Eur. J. Oper. Res. 212 (3) (2011)
Una Benlic, Jin-Kao Hao
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning. ICTAI (1) (2010)