Transit sets of k-point crossover operators

dc.contributor.authorChangat M.en_US
dc.contributor.authorNarasimha-Shenoi P.G.en_US
dc.contributor.authorNezhad F.H.en_US
dc.contributor.authorKov�e M.en_US
dc.contributor.authorMohandas S.en_US
dc.contributor.authorRamachandran A.en_US
dc.contributor.authorStadler P.F.en_US
dc.date.accessioned2025-02-17T08:47:50Z
dc.date.issued2019
dc.description.abstractk-point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of k-point crossover generate, for all k>1, the same convexity as the interval function of the underlying graph. This settles in the negative an open problem by Mulder about whether the geodesic convexity of a connected graph G is uniquely determined by its interval function I. The conjecture of Gitchoff and Wagner that for each transit set R k (x,y) distinct from a hypercube there is a unique pair of parents from which it is generated is settled affirmatively. Along the way we characterize transit functions whose underlying graphs are Hamming graphs, and those with underlying partial cube graphs. For general values of k it is shown that the transit sets of k-point crossover operators are the subsets with maximal Vapnik�Chervonenkis dimension. � 2019 Kalasalingam Universityen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.akcej.2019.03.019
dc.identifier.urihttps://idr.iitbbs.ac.in/handle/2008/2496
dc.language.isoenen_US
dc.subjectBetweennessen_US
dc.subjectGenetic algorithmsen_US
dc.subjectRecombinationen_US
dc.subjectTransit functionsen_US
dc.subjectVapnik�Chervonenkis dimensionen_US
dc.titleTransit sets of k-point crossover operatorsen_US
dc.typeArticleen_US

Files