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

Full description

Saved in:

Bibliographic Details
Published in:	Computational intelligence and neuroscience Vol. 2021; no. 1
Main Authors:	Wang, Zhaocai, Bao, Xiaoguang, Wu, Tunhua
Format:	Journal Article
Language:	English
Published:	New York Hindawi 2021 John Wiley & Sons, Inc
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!