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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational intelligence and neuroscience Jg. 2021; H. 1
Hauptverfasser:	Wang, Zhaocai, Bao, Xiaoguang, Wu, Tunhua
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Hindawi 2021 John Wiley & Sons, Inc
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!