A novel discrete particle swarm optimization to solve traveling salesman problem.


https://doi.org/10.1109/CEC.2007.4424894
@inproceedings{DBLP:conf/cec/ZhongZC07, author = {Wen{-}liang Zhong and Jun Zhang and Wei{-}neng Chen}, title = {A novel discrete particle swarm optimization to solve traveling salesman problem}, booktitle = {Proceedings of the {IEEE} Congress on Evolutionary Computation, {CEC} 2007, 25-28 September 2007, Singapore}, pages = {3283--3287}, publisher = {{IEEE}}, year = {2007}, url = {https://doi.org/10.1109/CEC.2007.4424894}, doi = {10.1109/CEC.2007.4424894}, timestamp = {Sun, 21 May 2017 00:21:50 +0200}, biburl = {https://dblp.org/rec/conf/cec/ZhongZC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21