A real adjacency matrix-coded evolution algorithm for highly linkage-based routing problems Online publication date: Mon, 06-Sep-2021
by Hang Wei; Han Huang; Zhi-Feng Hao; Qin-Qun Chen; Witold Pedrycz; Gang Li
International Journal of Bio-Inspired Computation (IJBIC), Vol. 18, No. 1, 2021
Abstract: In routing problems, the contribution of a variable to fitness often depends on the states of other variables. This phenomenon is referred to as linkage. High linkage level typically makes a routing problem more challenging for an evolutionary algorithm (EA). An entire linkage measure, named entire linkage index (ELI), has been proposed in this paper for such routing problems. Aiming at solving high linkage-based routing problems, we presented a real adjacency matrix-coded evolution algorithm (RAMEA) that is capable of learning and evolving correlation matrix of decision variables. The efficiency of RAMEA was tested on two familiar routing problems: travelling salesman problem (TSP) and generalised travelling salesman problem (GTSP). The experimental results show that the RAMEA is promising for those highly linkage-based routing problems, especially for those of large-scale.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook