NDLI: A Compounded Genetic and Simulated Annealing Algorithm for the Closest String Problem

Content Provider	IEEE Xplore Digital Library
Author	Xiaolan Liu Holger, M. Zhifeng Hao Guangchao Wu
Copyright Year	2008
Description	Author affiliation: Sch. of Comput. Sci. &Eng., South China Univ. of Technol., Guangzhou (Xiaolan Liu)
Abstract	The closest string problem is an NP-hard problem, which arises in computational molecular biology and coding theory. Its task is to find a string that minimizes maximum Hamming distance to a given set of strings. In this paper, a compounded genetic and simulated annealing algorithm (CGSA) which combines the merits of genetic algorithms and simulated annealing is presented to solve CSP. An adapting two-point crossover operator and a heuristic gene mutation operator designed by us are used in CGSA. In addition, by analyzing the optimal solution's structural features some rules are designed to pretreat the data, which reduces the problem size. We report computational results which show that the CGSA is capable of finding good solutions in a reasonable amount of time.
Starting Page	702
Ending Page	705
File Size	186678
Page Count	4
File Format	PDF
ISBN	9781424417476
DOI	10.1109/ICBBE.2008.171
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-05-16
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Codes NP-hard problem Hamming distance Biological system modeling Computational modeling Genetic mutations Simulated annealing Biology computing Computational biology Genetic algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Task Scheduling using Parallel Genetic Simulated Annealing Algorithm

A Genetic Approximation of Closest String via Rank Distance

A Memetic Algorithm for closest string problem and farthest string problem

A metaevolutionary approach for the traveling salesman problem

An Improved Hybrid Genetic Algorithms Using Simulated Annealing

Efficient Scheduling of Task Graphs to Multiprocessors Using a Combination of Modified Simulated Annealing and List Based Scheduling

Optimal Solutions for the Closest-String Problem via Integer Programming (2004)

The Improved Genetic Algorithm for Assingment Problems

An Hybrid Evaluative Algorithm Applied to Task Scheduling

A Compounded Genetic and Simulated Annealing Algorithm for the Closest String Problem

Similar Documents

Task Scheduling using Parallel Genetic Simulated Annealing Algorithm

A Genetic Approximation of Closest String via Rank Distance

A Memetic Algorithm for closest string problem and farthest string problem

A metaevolutionary approach for the traveling salesman problem

An Improved Hybrid Genetic Algorithms Using Simulated Annealing

Efficient Scheduling of Task Graphs to Multiprocessors Using a Combination of Modified Simulated Annealing and List Based Scheduling

Optimal Solutions for the Closest-String Problem via Integer Programming (2004)

The Improved Genetic Algorithm for Assingment Problems

An Hybrid Evaluative Algorithm Applied to Task Scheduling

A Compounded Genetic and Simulated Annealing Algorithm for the Closest String Problem