A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem

Author： Chowdhury Arkabandhu Ghosh Arnab Sinha Subhajit Das Swagatam Ghosh Avishek

ISSN： 1758-0366

Source： International Journal of Bio-Inspired Computation, Vol.5, Iss.5, 2013-10, pp. : 303-314

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Genetic algorithm solution for partial digest problem

By Ahrabian Hayedeh Ganjtabesh Mohammad Nowzari-Dalini Abbas Razaghi-Moghadam-Kashani Zahra

International Journal of Bioinformatics Research and Applications, Vol. 9, Iss. 6, 2013-09 ,pp. : 584-594

Inderscience Publishers

Access to resources Recommend Favorite

An effective algorithm of motif finding problem

By Chen Yong Li Guojun

International Journal of Bioinformatics Research and Applications, Vol. 4, Iss. 2, 2008-05 ,pp. : 137-149

Inderscience Publishers

Access to resources Recommend Favorite

Non-dominated sorting genetic algorithm with decomposition to solve constrained optimisation problems

By Zeng Sanyou Zhou Dong Li Hui

International Journal of Bio-Inspired Computation, Vol. 5, Iss. 3, 2013-07 ,pp. : 150-163

Inderscience Publishers

Access to resources Recommend Favorite

Novel hybrid genetic algorithm for progressive multiple sequence alignment

By Afridi Muhammad Ishaq

International Journal of Bioinformatics Research and Applications, Vol. 9, Iss. 6, 2013-09 ,pp. : 614-624

Inderscience Publishers

Access to resources Recommend Favorite

A new design method using opposition-based BAT algorithm for IIR system identification problem

By Saha Suman Kumar

International Journal of Bio-Inspired Computation, Vol. 5, Iss. 2, 2013-04 ,pp. : 99-132

Inderscience Publishers

Access to resources Recommend Favorite