Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

Eraldo R. Fernandes; Celso C. Ribeiro

doi:10.1007/11427186_2

Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

Eraldo R. Fernandes^*
, Celso C. Ribeiro

^*Korrespondierende/r Autor/-in für diese Arbeit

Publikation: Beiträge in Sammelwerken › Aufsätze in Konferenzbänden › Forschung › Begutachtung

7 Zitate (Scopus)

Abstract

We describe a multistart heuristic using an adaptive memory strategy for the problem of sequencing by hybridization. The memory-based strategy is able to significantly improve the performance of memoryless construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genetic algorithms.

Originalsprache	Englisch
Titel	Experimental and Efficient Algorithms : 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings
Redakteure/-innen	Sotiris E. Nikoletseas
Seitenumfang	12
Erscheinungsort	Berlin
Herausgeber (Verlag)	Springer Verlag
Erscheinungsdatum	01.01.2005
Seiten	4-15
ISBN (Print)	978-3-540-25920-6
ISBN (elektronisch)	978-3-540-32078-4
DOIs	https://doi.org/10.1007/11427186_2
Publikationsstatus	Erschienen - 01.01.2005
Extern publiziert	Ja
Veranstaltung	4th International Workshop on Experimental and Efficient Algorithms, WEA 2005 - Santorini Island, Griechenland Dauer: 10.05.2005 → 13.05.2005 Konferenznummer: 4

Fachgebiete und Schlagwörter

Informatik
Wirtschaftsinformatik

Zugriff auf Dokument

10.1007/11427186_2

Dieses zitieren

Fernandes, E. R., & Ribeiro, C. C. (2005). Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. in S. E. Nikoletseas (Hrsg.), Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings (S. 4-15). (Lecture Notes in Computer Science; Band 3503). Springer Verlag. https://doi.org/10.1007/11427186_2

Fernandes, Eraldo R. ; Ribeiro, Celso C. / Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings. Hrsg. / Sotiris E. Nikoletseas. Berlin : Springer Verlag, 2005. S. 4-15 (Lecture Notes in Computer Science).

@inbook{340caa6548354c5190e827a59cd298f1,

title = "Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization",

abstract = "We describe a multistart heuristic using an adaptive memory strategy for the problem of sequencing by hybridization. The memory-based strategy is able to significantly improve the performance of memory less construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genetic algorithms.",

keywords = "Informatics, genetic algorithm, target sequence, Tabu search, test instance, average similarity, Business informatics",

author = "Fernandes, \{Eraldo R.\} and Ribeiro, \{Celso C.\}",

year = "2005",

month = jan,

day = "1",

doi = "10.1007/11427186\_2",

language = "English",

isbn = "978-3-540-25920-6 ",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "4--15",

editor = "Nikoletseas, \{Sotiris E.\}",

booktitle = "Experimental and Efficient Algorithms",

address = "Germany",

note = "4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, WEA 2005 ; Conference date: 10-05-2005 Through 13-05-2005",

}

Fernandes, ER & Ribeiro, CC 2005, Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. in SE Nikoletseas (Hrsg.), Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings. Lecture Notes in Computer Science, Bd. 3503, Springer Verlag, Berlin, S. 4-15, 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, Santorini Island, Griechenland, 10.05.05. https://doi.org/10.1007/11427186_2

Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. / Fernandes, Eraldo R.; Ribeiro, Celso C.
Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings. Hrsg. / Sotiris E. Nikoletseas. Berlin: Springer Verlag, 2005. S. 4-15 (Lecture Notes in Computer Science; Band 3503).

Publikation: Beiträge in Sammelwerken › Aufsätze in Konferenzbänden › Forschung › Begutachtung

TY - CHAP

T1 - Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

AU - Fernandes, Eraldo R.

AU - Ribeiro, Celso C.

N1 - Conference code: 4

PY - 2005/1/1

Y1 - 2005/1/1

N2 - We describe a multistart heuristic using an adaptive memory strategy for the problem of sequencing by hybridization. The memory-based strategy is able to significantly improve the performance of memory less construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genetic algorithms.

AB - We describe a multistart heuristic using an adaptive memory strategy for the problem of sequencing by hybridization. The memory-based strategy is able to significantly improve the performance of memory less construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genetic algorithms.

KW - Informatics

KW - genetic algorithm

KW - target sequence

KW - Tabu search

KW - test instance

KW - average similarity

KW - Business informatics

UR - https://www.scopus.com/pages/publications/24944590986

UR - https://d-nb.info/974313114

U2 - 10.1007/11427186_2

DO - 10.1007/11427186_2

M3 - Article in conference proceedings

AN - SCOPUS:24944590986

SN - 978-3-540-25920-6

T3 - Lecture Notes in Computer Science

SP - 4

EP - 15

BT - Experimental and Efficient Algorithms

A2 - Nikoletseas, Sotiris E.

PB - Springer Verlag

CY - Berlin

T2 - 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005

Y2 - 10 May 2005 through 13 May 2005

ER -

Fernandes ER, Ribeiro CC. Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. in Nikoletseas SE, Hrsg., Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings. Berlin: Springer Verlag. 2005. S. 4-15. (Lecture Notes in Computer Science). doi: 10.1007/11427186_2

Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

Abstract

Fachgebiete und Schlagwörter

Zugriff auf Dokument

Fingerprint

Dieses zitieren