Contribution for crossover and mutation for degree constrained minimum spanning tree problem (d-MSTP) Online publication date: Wed, 15-Apr-2015
by Nacira Ghoualmi-Zine; Rachid Mahmoudi
International Journal of Engineering Management and Economics (IJEME), Vol. 3, No. 1/2, 2012
Abstract: In this article, we are interested in managing engineering design of ad hoc wireless network. We have to design topology of such networks to guarantee all nodes cover. So, spanning tree concept is applied to design and optimise the tree with the constraint of the degree (d-MSTP) of the multipoint relay (MPR). The first part relates the previous work and the specification of the proposed crossing and mutation operators. The new operators provide the locality and complete heredity. We target to generate only valid solutions without intermediate stages such as detection's cycle and elimination's cycle. The encoding used is edges-set. In the second part, we develop an optimisation application-based genetic algorithm applying our new operators. Simulation's parameters are small and large complete graph. We give simulation's results vs. Zou et al.'s results. We conclude, the fitness value is improved and the search space is reduced.
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 Engineering Management and Economics (IJEME):
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