摘要
A chaotic algorithm for providing a solution to the bi-level Discrete Equilibrium Network Design Problem （NDP） is discussed following an introduction of the Discrete Network Design Problem （DNDP） model and Chaos Optimization Algorithms （COA）. A description of the chaotic approach for the DNDP model is described in details. Then a numerical example for the DNDP is carried out to investigate the chaotic approach. The results have been encouraging, indicating that the chaotic approach has great potential ability in finding the optimal solution of DNDP models.
基金
This project is supported partly by National 0utstanding Young Investigation of National Natural Science Foundation of China（70225005,70471088,70501004 and 70501005）, the Special Research Found for Doctoral Programs in State Education Ministry （20050004005）, the 211 Project of Discipline Construction of Beijing Jiaotong University and Rencai Foundation of Beijing Jiaotong University （2003RC010）
