NP-hard combinational optimization problem is not solved very well until now. One enhanced ants system based on ants system is advanced after analysis of the deficiencies of existing ants systems. Some improvements ar...NP-hard combinational optimization problem is not solved very well until now. One enhanced ants system based on ants system is advanced after analysis of the deficiencies of existing ants systems. Some improvements are made in state transfer rule and local modification rule. Furthermore, the enhanced ants system can solve NP-hard combinational optimization problem with restraints and condition path. The successful application of TSP problem and transportation net problem indicates that the proposed system has stronger function and higher efficiency than the original system.展开更多
基金This project was supported by the National Natural Science Foundation of Shangdong Province (Y98F12093) .
文摘NP-hard combinational optimization problem is not solved very well until now. One enhanced ants system based on ants system is advanced after analysis of the deficiencies of existing ants systems. Some improvements are made in state transfer rule and local modification rule. Furthermore, the enhanced ants system can solve NP-hard combinational optimization problem with restraints and condition path. The successful application of TSP problem and transportation net problem indicates that the proposed system has stronger function and higher efficiency than the original system.
