Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Xueshi Dong"'
Publikováno v:
Tongxin xuebao, Vol 39, Pp 18-29 (2018)
In the fields such as intelligent transport and multiple tasks cooperation, the model scale constructed by colored bottleneck traveling salesman problem (CBTSP) tends to large scale, and therefore it is necessary to study the large scale CBTSP and it
Externí odkaz:
https://doaj.org/article/69ea48729810475e817a5c962c5bd1d6
Publikováno v:
IEEE Transactions on Human-Machine Systems. 53:228-238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::505e748e3f00c8618cd612a502ce8dc4
https://doi.org/10.1109/thms.2022.3176213
https://doi.org/10.1109/thms.2022.3176213
Publikováno v:
International Journal of Swarm Intelligence Research. 13:1-16
Based on the problems existing in the traditional ant colony algorithm in solving the traveling salesman problem, a hybrid ant colony algorithm combining the improved circle strategy and the ant colony algorithm is proposed. In the proposed hybrid an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::521b0d373dcc28adc1481b0253c27a18
https://doi.org/10.4018/ijsir.303573
https://doi.org/10.4018/ijsir.303573
Publikováno v:
Proceedings of the 2022 6th International Conference on Electronic Information Technology and Computer Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a831aca94000bbf1debef7001c5cc059
https://doi.org/10.1145/3573428.3573739
https://doi.org/10.1145/3573428.3573739
Publikováno v:
Future Generation Computer Systems. 114:229-242
The paper gives an optimization model named multiple bottleneck traveling salesmen problem (MBTSP), which can model the optimization problems where there are multiple salesmen and tasks. In intelligent transport systems and multiple tasks cooperation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d87e275da166f759cc55f14e6e1decd
https://doi.org/10.1016/j.future.2020.07.008
https://doi.org/10.1016/j.future.2020.07.008
Publikováno v:
IET Intelligent Transport Systems. 13:1483-1491
Coloured travelling salesman problem (CTSP) is an extended model of multiple travelling salesman problems (MTSPs), as one kind of problem in combination optimisation problems, which has been applied to many real-world planning problems such as multi-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9adacd7e0b0f6d65948648a7db0f1445
https://doi.org/10.1049/iet-its.2018.5359
https://doi.org/10.1049/iet-its.2018.5359
Autor:
Yongle Cai, Xueshi Dong
Publikováno v:
Future Generation Computer Systems. 95:727-742
The paper gives an applicable model called colored balanced traveling salesman problem (CBTSP), it is utilized to model optimization problems with partially overlapped workspace such as the scheduling and deploying of the resources and goods. CBTSP i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e53376a3cba6a48d1b2566105b1c6a77
https://doi.org/10.1016/j.future.2018.12.065
https://doi.org/10.1016/j.future.2018.12.065
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58bb1dbaa8b63b4b24aa88c45d8cfe69
https://doi.org/10.2139/ssrn.3980640
https://doi.org/10.2139/ssrn.3980640
Publikováno v:
Future Generation Computer Systems. 88:755-763
As a key problem in the social network, Influence Maximization(IM) has received extensive study. Since it is a well-known NP-complete problem, it is a great challenge to determine the initial diffusion seed nodes especially when the size of social ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ba0bf0a1ff502c994a71a09eb8497da
https://doi.org/10.1016/j.future.2018.04.026
https://doi.org/10.1016/j.future.2018.04.026
Publikováno v:
IET Intelligent Transport Systems. 12:774-782
Traditional algorithms, such as genetic algorithm and simulated annealing, have greatly attracted a lot of research studies due to their simplicity and flexibility to solve coloured travelling salesman problem (CTSP). However, their performance is li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3616fc32e113c9baf80a0a37bbddf30
https://doi.org/10.1049/iet-its.2016.0282
https://doi.org/10.1049/iet-its.2016.0282