科研成果 - 柯 良军
| Paper Name | Author | Publication/Completion Time | Magazine Name |
|---|---|---|---|
| Pareto mimic algorithm: an approach to the team orienteering problem | Liangjun Ke, et al. | 2015-08-18 | Omega |
| Hybidization of decomposition and local search for multiobjective optimization | Liangjun Ke, Qingfu Zhang,Roberto Battiti | 2014-04-16 | IEEE transactions on Cybernetics |
| Cooperating branch-and-price and metaheuristic for the team orienteering problem with time windows | Liangjun Ke, et al. | 2014-04-09 | IEEE CEC 2014, Beijing |
| A two-phase metaheuristic for the cumulative capacitated vehicle routing problem | Liangjun Ke, Zuren Feng | 2013-11-01 | Computers & Operations Research |
| Multiobjective combinatorial optimization by using decomposition and ant colony | Liangjun Ke, Qingfu Zhang,Roberto Battiti | 2013-04-09 | IEEE transactions on Cybernetics |
| Proportion based robust optimization and team orienteering problem with interval data | Liangjun Ke, et al. | 2013-03-13 | European Journal of Operational Research |
| Xiaoliang Wei. An ant colony optimization approach for the multidimensional knapsack problem | Liangjun Ke, Zuren Feng, Zhigang Ren | 2010-10-08 | Journal of Heuristics |
| Ants can solve the team orienteering problem | Liangjun Ke, Claudia Archetti, Zuren Feng | 2008-07-15 | Computers and Industrial Engineering |
| An efficient ant colony optimization approach to attribute reduction in rough set theory | Liangjun Ke, Zuren Feng, Zhigang Ren | 2008-06-10 | Pattern Recognition Letters |
| 有限级信息素蚁群算法 | 柯良军，冯祖仁，冯远静 | 2006-11-17 | 自动化学报 |
