Multi-parent extension of sequential constructive crossover for the travelling salesman problem Online publication date: Sat, 14-Feb-2015
by Zakir Hussain Ahmed
International Journal of Operational Research (IJOR), Vol. 11, No. 3, 2011
Abstract: Crossover operator plays a vital role in genetic algorithms. This paper proposes the multi-parent sequential constructive crossover (MPSCX), which generalises the two-parent sequential constructive crossover (SCX) to a multi-parent crossover for the travelling salesman problem (TSP). Experimental results on five TSPLIB instances show that MPSCX significantly improves SCX by up to 4.60% in average tour value with maximum 4.01% away from the exact optimal solution. Finally, the efficiency of the MPSCX is compared as against multi-parent partially mapped crossover (MPPMX). Experimental results show that the MPSCX is better than the MPPMX.
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 Operational Research (IJOR):
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