Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions

M. Jelasity, Boglarka Toth, Tamas Vinko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Characterization of trajectory structure of fitness landscapes is a major problem of evolutionary computation theory. In this paper a hardness measure of fitness landscapes is introduced which is based on statistical properties of trajectories. These properties are approximated with the help of a heuristic based on the transition probabilities between the elements of the search space. This makes it possible to compute the measure for some well-known functions: a ridge function, a long path function, a fully deceptive function and a combinatorial problem: the subset sum problem. Using the same transition probabilities the expected number of evaluations needed to reach the global optimum from any point in the space are approximated and examined for the above problems.

Original languageEnglish
Title of host publicationProceedings of the 1999 Congress on Evolutionary Computation, CEC 1999
PublisherIEEE Computer Society
Pages623-630
Number of pages8
Volume1
DOIs
Publication statusPublished - 1999
Event1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States
Duration: Jul 6 1999Jul 9 1999

Other

Other1999 Congress on Evolutionary Computation, CEC 1999
CountryUnited States
CityWashington, DC
Period7/6/997/9/99

Fingerprint

Fitness Landscape
Transition Probability
Pairwise
Trajectories
Trajectory
Ridge Functions
Subset Sum Problem
Longest Path
Computation theory
Global Optimum
Evolutionary Computation
Combinatorial Problems
Hardness
Statistical property
Search Space
Set theory
Evolutionary algorithms
Heuristics
Evaluation

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Jelasity, M., Toth, B., & Vinko, T. (1999). Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. In Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999 (Vol. 1, pp. 623-630). [781990] IEEE Computer Society. https://doi.org/10.1109/CEC.1999.781990

Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. / Jelasity, M.; Toth, Boglarka; Vinko, Tamas.

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. Vol. 1 IEEE Computer Society, 1999. p. 623-630 781990.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jelasity, M, Toth, B & Vinko, T 1999, Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. in Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. vol. 1, 781990, IEEE Computer Society, pp. 623-630, 1999 Congress on Evolutionary Computation, CEC 1999, Washington, DC, United States, 7/6/99. https://doi.org/10.1109/CEC.1999.781990
Jelasity M, Toth B, Vinko T. Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. In Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. Vol. 1. IEEE Computer Society. 1999. p. 623-630. 781990 https://doi.org/10.1109/CEC.1999.781990
Jelasity, M. ; Toth, Boglarka ; Vinko, Tamas. / Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. Vol. 1 IEEE Computer Society, 1999. pp. 623-630
@inproceedings{d6b4c234dc7449a8958222ee1d08c8d1,
title = "Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions",
abstract = "Characterization of trajectory structure of fitness landscapes is a major problem of evolutionary computation theory. In this paper a hardness measure of fitness landscapes is introduced which is based on statistical properties of trajectories. These properties are approximated with the help of a heuristic based on the transition probabilities between the elements of the search space. This makes it possible to compute the measure for some well-known functions: a ridge function, a long path function, a fully deceptive function and a combinatorial problem: the subset sum problem. Using the same transition probabilities the expected number of evaluations needed to reach the global optimum from any point in the space are approximated and examined for the above problems.",
author = "M. Jelasity and Boglarka Toth and Tamas Vinko",
year = "1999",
doi = "10.1109/CEC.1999.781990",
language = "English",
volume = "1",
pages = "623--630",
booktitle = "Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions

AU - Jelasity, M.

AU - Toth, Boglarka

AU - Vinko, Tamas

PY - 1999

Y1 - 1999

N2 - Characterization of trajectory structure of fitness landscapes is a major problem of evolutionary computation theory. In this paper a hardness measure of fitness landscapes is introduced which is based on statistical properties of trajectories. These properties are approximated with the help of a heuristic based on the transition probabilities between the elements of the search space. This makes it possible to compute the measure for some well-known functions: a ridge function, a long path function, a fully deceptive function and a combinatorial problem: the subset sum problem. Using the same transition probabilities the expected number of evaluations needed to reach the global optimum from any point in the space are approximated and examined for the above problems.

AB - Characterization of trajectory structure of fitness landscapes is a major problem of evolutionary computation theory. In this paper a hardness measure of fitness landscapes is introduced which is based on statistical properties of trajectories. These properties are approximated with the help of a heuristic based on the transition probabilities between the elements of the search space. This makes it possible to compute the measure for some well-known functions: a ridge function, a long path function, a fully deceptive function and a combinatorial problem: the subset sum problem. Using the same transition probabilities the expected number of evaluations needed to reach the global optimum from any point in the space are approximated and examined for the above problems.

UR - http://www.scopus.com/inward/record.url?scp=84878267031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878267031&partnerID=8YFLogxK

U2 - 10.1109/CEC.1999.781990

DO - 10.1109/CEC.1999.781990

M3 - Conference contribution

VL - 1

SP - 623

EP - 630

BT - Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

PB - IEEE Computer Society

ER -