Genetic Algorithms and the Traveling Salesman Problem a historical Review

01/17/2019
by   Jan Scholz, et al.
0

In this paper a highly abstracted view on the historical development of Genetic Algorithms for the Traveling Salesman Problem is given. In a meta-data analysis three phases in the development can be distinguished. First exponential growth in interest till 1996 can be observed, growth stays linear till 2011 and after that publications deteriorate. These three phases are examined and the major milestones are presented. Lastly an outlook to future work in this field is infered.

READ FULL TEXT

page 4

page 6

research
12/19/2018

Intermediacy of publications

Citation networks of scientific publications offer fundamental insights ...
research
04/06/2020

Covid-19 – A simple statistical model for predicting ICU load in exponential phases of the disease

One major bottleneck in the ongoing Covid-19 pandemic is the limited num...
research
07/17/2018

Genetic algorithms in Forth

A method for automatically finding a program (bytecode) realizing the gi...
research
11/05/2020

Qualities, challenges and future of genetic algorithms: a literature review

Genetic algorithms, computer programs that simulate natural evolution, a...
research
07/02/2020

On the use of historical estimates

The use of historical estimates in current studies is common in a wide v...
research
02/19/2023

Two Cellular Resource Based Models Linking Growth and Parts Characteristics Aids the Study and Optimization of Synthetic Gene Circuits

A major challenge in synthetic genetic circuit development is the inter-...
research
05/21/2018

Computational Historical Linguistics

Computational approaches to historical linguistics have been proposed si...

Please sign up or login with your details

Forgot password? Click here to reset