Solving traveling salesman problems using molecular programming

Author

Shin, Soo-Yong ; Zhang, Byoung-Tak ; Jun, Sung-Soo

Author_Institution

Dept. of Comput. Eng., Seoul Nat. Univ., South Korea

Volume

2

fYear

1999

fDate

1999

Abstract

Molecular programming (MP) has been proposed as an evolutionary computation algorithm at the molecular level (B.T. Zhang and S.Y. Shin, 1998). MP is different from other evolutionary algorithms in its representation of solutions using DNA molecular structures and its use of bio-lab techniques for recombination of partial solutions. Molecular programming is applied to traveling salesman problems (TSPs) whose solution requires encoding of real values in DNA strands. We propose a new encoding scheme for real values that is biologically plausible and has a fixed code length. The effectiveness of the proposed method is verified by simulations and by comparison with A. Narayanan and S. Zorbalas´ (1998) method

Keywords

biocomputing; encoding; evolutionary computation; travelling salesman problems; DNA molecular structures; DNA strands; TSPs; bio-lab techniques; encoding scheme; evolutionary algorithms; evolutionary computation algorithm; fixed code length; molecular programming; partial solutions; traveling salesman problems; Artificial intelligence; Biological information theory; Biological system modeling; Biology computing; DNA computing; Encoding; Evolution (biology); Evolutionary computation; Genetic programming; Traveling salesman problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on

Conference_Location

Washington, DC

Print_ISBN

0-7803-5536-9

Type

conf

DOI

10.1109/CEC.1999.782531

Filename

782531