Una Benlic

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