Basic Information


Liangjun Ke,   Ph.D.

 Associate Professor, Ph.D. supervisor

Systems Engineering Institute

 Xi’an Jiaotong University, China

Contact

Email:   kelj163@163.com

OfficeRoom 409YI-FU Science Building

Homepage: http://keljxjtu.gr.xjtu.edu.cn

 

Education and Work Experience

Education:

  1. ·    2004-2008  Ph.D. Degree, Xi’an Jiaotong University,  Systems Engineering Institute
  2. ·    1994-2001  B.S. and M.S. Degree, Wuhan University, Mathematics
  3.  Work experience:
  4. ·    2013/02—Xi'an Jiaotong University, Associate Prof.

    ·    2014/06—2014/08HongKong PolyU, ISE, research fellow
  5. ·   2011/10—2012/10University of Essex, UK, visiting scholar
  6. ·   2009/03—2011/09Xi'an Jiaotong University, PostDoc
  7. ·   2008/07—2012/12Xi'an Jiaotong University, Lecturer
招生信息

主持国家自然科学基金、博士点基金、博士后特别资助基金等科研项目。近年来在European Journal of Operational ResearchIEEE transaction on Cybernetics等国际权威期刊发表论文10余篇, SCI他引超过100次,单篇最高43次。

 

培养的学生已经在华为、航空研究院631所等单位工作。

 

研究生将有机会去香港城市大学、香港理工大学等科研机构交流学习。

 

欢迎有兴趣的研究生报名!!!

Selected Publications and Projects

Selected Publications:

9. Liangjun Ke, et al., Pareto mimic algorithm: an approach to the team orienteering problem. Omega, 2015. (SCI,  

      Impact factor:4.376)

8. Liangjun Ke, et al., Proportion based robust optimization and team orienteering problem with interval data. European Journal of Operational Research. 2013, 226(1): 19-31. (SCI, Impact factor:2.038)
7. Liangjun Ke, Qingfu Zhang, Roberto Battiti, Hybidization of decomposition and local search for multiobjective optimization.  IEEE transactions on Cybernetics, 2014, 44(10): 1808-1820. (SCI, Impact factor:3.236)
6. Liangjun Ke, Qingfu Zhang, Roberto Battiti, Multiobjective combinatorial optimization by using decomposition and ant colony. IEEE transactions on Cybernetics, 2013, 43(6): 1845-1859. (SCI, Impact factor:3.236)
5. Liangjun Ke, Zuren Feng. A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Computers & Operations Research. 2013, 40(2): 633-638. (SCI, Impact factor:1.868)
4. Liangjun Ke, et al., Cooperating branch-and-price and metaheuristic for the team orienteering problem with time windows, IEEE CEC 2014, Beijing.
3. Liangjun Ke, Zuren Feng, Zhigang Ren, Xiaoliang Wei. An ant colony optimization approach for the multidimensional knapsack problem. Journal of Heuristics, 2010, 16(1): 65-83. (SCI, Impact factor:1.359)
2. Liangjun Ke, Claudia Archetti, Zuren Feng. Ants can solve the team orienteering problem. Computers and Industrial Engineering, 2008, 54(3): 648-665. (SCI, Impact factor:1.589)
1. Liangjun Ke, Zuren Feng, Zhigang Ren. An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognition Letters, 2008, 29(9): 1351-1357. (SCI, Impact factor:1.834)

Papers in Chinese:

1柯良军,冯祖仁,冯远静. 有限级信息素蚁群算法. 自动化学报, 2006, 32(2): 296–303. (code) 

Projects: 

1. National Natural Science Foundation 60905044, 61573277 (PI).

* He has participated several NSF projects and others scientific projects as a member. 

版权所有:西安交通大学 站点设计:数据与信息中心 陕ICP备05001571号 IPhone版本下载 IPhone版本下载    Android版本下载 Android版本下载
欢迎您访问我们的网站,您是第 位访客
推荐分辨率1024*768以上 推荐浏览器IE7 Fifefox 以上