| 2012 | ||
|---|---|---|
| j5 | Xiangyong Li, Stephen C. H. Leung, Peng Tian: A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Syst. Appl. 39(1): 365-374 (2012) | |
| c14 | Jun Zhang, Hui Tian, Peng Tian, Yao Huang, Liqi Gao: Dynamic Frequency Reservation Scheme for Interference Coordination in LTE-Advanced Heterogeneous Networks. VTC Spring 2012: 1-5 | |
| c13 | ||
| 2009 | ||
| j4 | Xiangyong Li, Peng Tian, Stephen C. H. Leung: An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems. JORS 60(7): 1012-1025 (2009) | |
| c12 | Chenguang Guo, Yongxian Liu, Peng Tian, Shouming Hou: Fuzzy Comprehensive Evaluation Method of the Importance Ratings of Customers' Requirements. DET 2009: 361-373 | |
| 2008 | ||
| j3 | Min Kong, Peng Tian, Yucheng Kao: A new ant colony optimization algorithm for the multidimensional Knapsack problem. Computers & OR 35(8): 2672-2683 (2008) | |
| 2006 | ||
| c11 | Min Kong, Peng Tian: A Direct Application of Ant Colony Optimization to Function Optimization Problem in Continuous Domain. ANTS Workshop 2006: 324-331 | |
| c10 | Xiangyong Li, Peng Tian: An Ant Colony System for the Open Vehicle Routing Problem. ANTS Workshop 2006: 356-363 | |
| c9 | ||
| c8 | Min Kong, Peng Tian: Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem. ICAISC 2006: 1140-1149 | |
| c7 | Xiangyong Li, Peng Tian, Xiaoping Min: A Hierarchical Particle Swarm Optimization for Solving Bilevel Programming Problems. ICAISC 2006: 1169-1178 | |
| c6 | ||
| c5 | ||
| c4 | Xiangyong Li, Peng Tian, Jing Hua, Ning Zhong: A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem. SEAL 2006: 181-188 | |
| 2005 | ||
| c3 | Xiangyong Li, Peng Tian, Min Kong: A Novel Particle Swarm Optimization for Constrained Optimization Problems. Australian Conference on Artificial Intelligence 2005: 1305-1310 | |
| c2 | Min Kong, Peng Tian: A Binary Ant Colony Optimization for the Unconstrained Function Optimization Problem. CIS (1) 2005: 682-687 | |
| c1 | Min Kong, Peng Tian: A Convergence Proof for the Ant Colony Optimization Algorithms. IC-AI 2005: 118-121 | |
| 2000 | ||
| j2 | Jian Ma, Peng Tian, Dong-Mo Zhang: Global optimization by Darwin and Boltzmann mixed strategy. Computers & OR 27(2): 143-159 (2000) | |
| 1999 | ||
| j1 | Peng Tian, Jian Ma, Dong-Mo Zhang: Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism. European Journal of Operational Research 118(1): 81-94 (1999) | |
Colors in the list of coauthors
Last update Sat May 18 13:43:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page