A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing

The Chinese postman problem is a classic resource allocation and scheduling problem, which has been widely used in practice. As a classical nondeterministic polynomial problem, finding its efficient algorithm has always been the research direction of scholars. In this paper, a new bioinspired algori...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational intelligence and neuroscience Ročník 2021; číslo 1
Hlavní autori:	Wang, Zhaocai, Bao, Xiaoguang, Wu, Tunhua
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Hindawi 2021 John Wiley & Sons, Inc
Predmet:	Algorithms Analysis Chains Combinatorial analysis Complexity Computer applications Deoxyribonucleic acid DNA Efficiency Experiments Feasibility Integer programming Molecular biology Optimization Polynomials Post offices Resource allocation Resource scheduling Solution space Storage capacity Traveling salesman problem China
ISSN:	1687-5265, 1687-5273
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!