| 2008 |
|---|
| 13 | EE | 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 |
|---|
| 12 | EE | Min Kong,
Peng Tian:
A Direct Application of Ant Colony Optimization to Function Optimization Problem in Continuous Domain.
ANTS Workshop 2006: 324-331 |
| 11 | EE | Xiangyong Li,
Peng Tian:
An Ant Colony System for the Open Vehicle Routing Problem.
ANTS Workshop 2006: 356-363 |
| 10 | EE | Min Kong,
Peng Tian:
Introducing a Binary Ant Colony Optimization.
ANTS Workshop 2006: 444-451 |
| 9 | EE | Min Kong,
Peng Tian:
Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem.
ICAISC 2006: 1140-1149 |
| 8 | EE | Xiangyong Li,
Peng Tian,
Xiaoping Min:
A Hierarchical Particle Swarm Optimization for Solving Bilevel Programming Problems.
ICAISC 2006: 1169-1178 |
| 7 | EE | Min Kong,
Peng Tian:
Application of ACO in Continuous Domain.
ICNC (2) 2006: 126-135 |
| 6 | EE | Min Kong,
Peng Tian:
A New Ant Colony Optimization Applied for the Multidimensional Knapsack Problem.
SEAL 2006: 142-149 |
| 5 | EE | Xiangyong Li,
Peng Tian,
Jing Hua,
Ning Zhong:
A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem.
SEAL 2006: 181-188 |
| 2005 |
|---|
| 4 | EE | Xiangyong Li,
Peng Tian,
Min Kong:
A Novel Particle Swarm Optimization for Constrained Optimization Problems.
Australian Conference on Artificial Intelligence 2005: 1305-1310 |
| 3 | EE | Min Kong,
Peng Tian:
A Binary Ant Colony Optimization for the Unconstrained Function Optimization Problem.
CIS (1) 2005: 682-687 |
| 2 | | Min Kong,
Peng Tian:
A Convergence Proof for the Ant Colony Optimization Algorithms.
IC-AI 2005: 118-121 |
| 2000 |
|---|
| 1 | EE | Jian Ma,
Peng Tian,
Dong-Mo Zhang:
Global optimization by Darwin and Boltzmann mixed strategy.
Computers & OR 27(2): 143-159 (2000) |
